Yves Pochet

According to our database1, Yves Pochet authored at least 24 papers between 1988 and 2010.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2010
Single item lot-sizing with non-decreasing capacities.
Math. Program., 2010

Coefficient strengthening: a tool for reformulating mixed-integer programs.
Math. Program., 2010

An integrated model for warehouse and inventory planning.
European Journal of Operational Research, 2010

Scheduling an operating theatre under human resource constraints.
Computers & Industrial Engineering, 2010

2009
Uncapacitated lot sizing with backlogging: the convex hull.
Math. Program., 2009

Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs.
European Journal of Operational Research, 2009

2008
A tighter continuous time formulation for the cyclic scheduling of a mixed plant.
Computers & Chemical Engineering, 2008

LS-LIB: A Library of Tools for Solving Production Planning Problems.
Proceedings of the Research Trends in Combinatorial Optimization, 2008

2006
Feedback stabilization of the Operation of an Hybrid Chemical plant.
Proceedings of the 2nd IFAC Conference on Analysis and Design of Hybrid Systems, 2006

2004
A General Heuristic for Production Planning Problems.
INFORMS Journal on Computing, 2004

A New Formulation and Resolution Method for the p-Center Problem.
INFORMS Journal on Computing, 2004

2001
The uncapacitated lot-sizing problem with sales and safety stocks.
Math. Program., 2001

Mixing mixed-integer inequalities.
Math. Program., 2001

The Symmetric Traveling Salesman Polytope Revisited.
Math. Oper. Res., 2001

Mathematical Programming Models and Formulations for Deterministic Production Planning Problems.
Proceedings of the Computational Combinatorial Optimization, 2001

1998
The Sequential Knapsack Polytope.
SIAM Journal on Optimization, 1998

Forward-reserve allocation in a warehouse with unit-load replenishments.
European Journal of Operational Research, 1998

1995
Capacitated Facility Location: Valid Inequalities and Facets.
Math. Oper. Res., 1995

Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation.
Discrete Applied Mathematics, 1995

1994
Polyhedra for lot-sizing with Wagner-Whitin costs.
Math. Program., 1994

1993
Lot-Sizing with Constant Batches: Formulation and Valid Inequalities.
Math. Oper. Res., 1993

Algorithms and reformulations for lot sizing problems.
Proceedings of the Combinatorial Optimization, 1993

1992
Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1988
Lot-size models with backlogging: Strong reformulations and cutting planes.
Math. Program., 1988


  Loading...