Mitra G.

G. Mitra

Information about the author G. Mitra will soon be added to the site.
Found 9 papers in total
Robust solutions and risk measures for a supply chain planning problem under uncertainty
Robust solutions and risk measures for a supply chain planning problem under uncertainty
2008
We consider a strategic supply chain planning problem formulated as a two-stage...
A two-stage parallel branch and bound algorithm for mixed integer programs
A two-stage parallel branch and bound algorithm for mixed integer programs
2004
Mixed integer programming (MIP) models are extensively used to aid strategic and...
A co-operative parallel heuristic for mixed zero–one linear programming: Combining simulated annealing with branch and bound
A co-operative parallel heuristic for mixed zero–one linear programming: Combining simulated annealing with branch and bound
2005
This paper considers the exact approach of branch and bound (B&B) and the...
Modelling and solving environments for mathematical programming: A status review and new directions
Modelling and solving environments for mathematical programming: A status review and new directions
2002
Languages and computing environments that support Mathematical Programming (MP)...
An application of Lagrangian relaxation to a capacity planning problem under uncertainty
An application of Lagrangian relaxation to a capacity planning problem under uncertainty
2001
A supply chain network-planning problem is presented as a two-stage resource...
Modelling and analysis of multistage stochastic programming problems: A software environment
Modelling and analysis of multistage stochastic programming problems: A software environment
1997
In many decision problems, time and uncertainty play important roles and stochastic...
Tools for reformulating logical forms into zero-one mixed integer programs
Tools for reformulating logical forms into zero-one mixed integer programs
1994
A systematic procedure for transforming a set of logical statements or logical...
Solution of set-covering and set-partitioning problems using assignment relaxations
Solution of set-covering and set-partitioning problems using assignment relaxations
1992
Graph theoretic relaxations are used to design tree search algorithms for set-covering...
Set covering and set partitioning: A collection of test problems
Set covering and set partitioning: A collection of test problems
1990
It is now well established that set covering and set partitioning models play a...
Papers per page: