Subir Bhattacharya

According to our database1, Subir Bhattacharya authored at least 22 papers between 1986 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
'Buy online and pick up in-store': Implications for the store inventory.
Eur. J. Oper. Res., 2021

2017
Economic Perspective Of Omnichannel: A Preliminary Analysis.
Proceedings of the 11th Mediterranean Conference on Information Systems, 2017

2015
Perceptions about Agility Enablers and their Relative Importance: a Collation.
Proceedings of the 21st Americas Conference on Information Systems, 2015

IT for Managers: Journey of a core MBA course over ten years.
Proceedings of the 21st Americas Conference on Information Systems, 2015

2012
Cooperative Search Using Agents for Cardinality Constrained Portfolio Selection Problem.
IEEE Trans. Syst. Man Cybern. Part C, 2012

Towards a Framework for Assessing Agility.
Proceedings of the 45th Hawaii International International Conference on Systems Science (HICSS-45 2012), 2012

2010
A Systems View of Software Requirement volatility.
Proceedings of the Sustainable IT Collaboration Around the Globe. 16th Americas Conference on Information Systems, 2010

2009
A State Task Network model for scheduling operations in cascaded continuous processing units.
Comput. Chem. Eng., 2009

Impact of Requirements Discovery Pattern on Software Project Outcome: Preliminary Results.
Proceedings of the 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), 2009

Agent Based Model for Cardinality Constrained Portfolio Selection Problem: Preliminary Results.
Proceedings of the 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), 2009

Multi-agent model for threshold constrained portfolio selection.
Proceedings of the IEEE Conference on Automation Science and Engineering, 2009

2008
A two pass heuristic algorithm for scheduling 'blocked out' units in continuous process industry.
Ann. Oper. Res., 2008

2007
Mathematical model for scheduling operations in cascaded continuous processing units.
Eur. J. Oper. Res., 2007

1999
The multiple resource constrained project scheduling problem: A breadth-first approach.
Eur. J. Oper. Res., 1999

1998
An exact depth-first algorithm for the pallet loading problem.
Eur. J. Oper. Res., 1998

1996
Searching Game Trees Under Memory Constraints.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995
Experimenting with Revisits in Game Tree Search.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994
A General Framework for Minimax Search in Game Trees.
Inf. Process. Lett., 1994

1993
A Faster Alternative to SSS* with Extension to Variable Memory.
Inf. Process. Lett., 1993

1992
QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies.
Proceedings of the Automated Reasoning, 1992

1989
Searching Game Trees in Parallel Using SSS.
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

1986
Making Best Use of Available Memory When Searching Game Trees.
Proceedings of the 5th National Conference on Artificial Intelligence. Philadelphia, 1986


  Loading...