Actions
Incoming Resources
- Capacitated facility location, valid inequalities and facets
- Optimal trees
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Aggregation and mixed integer rounding to solve MIPs
- Cutting planes in integer and mixed integer programming
- The uncapacitated lot-sizing problem with sales and safety stocks
- On the Wagner-Whitin lot-sizing polyhedron
- Formulations and valid inequalities for the node capacitated graph partitioning problem
- Scheduling projects with labor constraints
- Optimal placement of add/drop multiplexers, heuristic and exact algorithms
- Modelling practical lot-sizing problems as mixed integer programs
- The 0-1 knapsack problem with a single continuous variable
- Integer knapsack and flow covers with divisible coefficients, polyhedra, optimization and separation
- Optimizing constrained subtrees of trees
- Economic lot-sizing with start-up costs, the convex hull
- Dynamic knapsack sets and capacitated lot-sizing
- An exact algorithm for IP column generation
- Integral polyhedra with a cardinality constraint
- Polyhedra for lot-sizing with Wagner-Whitin costs
- A branch-and-cut algorithm for the single commodity uncapacitated fixed charge network flow problem
- A new approach to minimising the frontwidth in finite element calculations
- Combining problem structure with basis reduction to solve a class of hard integer programs
- Economic decision-making, games, econometrics, and optimisation : contributions in honour of Jacques H. Drèze, edited by J.J. Gabszewicz, J.F. Richard, L.A. Wolsey
- bc - opt, a branch-and-cut code for mixed integer programs
- The node capacitated graph partitioning problem, a computational study
- Cutting planes for integer programs with general integer variables
- Pigovian taxes, tradables permits and a dynamic process for an economy with pollution
- Designing private line networks, polyhedral analysis and computation
- Algorithms and reformulations for lot sizing problems
- Lot-sizing problems, modelling issues and a specialized branch-and-cut system "bc-prod"
- Lot-sizing with constant batches, formulation and valid inequalities
- On the cut polyhedron
- Non-standard approaches to integer programming
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- Discrete lot-sizing and convex integer programming