Integer Programming has 27 ratings and 2 reviews. Chris said: An excellent short introduction. It chooses some representative examples for important topi. Available in: Hardcover. A practical, accessible guide to optimization problems withdiscrete or integer variablesInteger Programming stands. List of computer science publications by Laurence A. Wolsey. Integer Programming and Constraint Programming in Solving a Multimachine Assignment.
|Published (Last):||8 November 2015|
|PDF File Size:||19.37 Mb|
|ePub File Size:||20.46 Mb|
|Price:||Free* [*Free Regsitration Required]|
Preview — Integer Programming by Laurence A. The Mixing Set with Flows. The node capacitated graph partitioning problem: Yiling Zhang rated it really liked it Jan 12, Faces for a linear inequality in variables. Wolsey WileySep 23, – Mathematics – pages 0 Reviews https: European Journal of Operational Research 3: Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times.
dblp: BibTeX records: Laurence A. Wolsey
Maximising Real-Valued Submodular Functions: Books by Laurence A. Want to Read saving…. PadbergTony J.
Return to Book Page. These include improved modeling, cutting plane theory and algorithms, heuristic methods, and branch-and-cut and integer programming decomposition algorithms. Operations Research 35 1: Strong formulations for mixed integer programming: Greg Werker rated it really liked it Mar 12, Network Design with Divisible Capacities: Discrete time formulations and valid inequalities.
Salahuddin Pasha rated it it was amazing Sep 07, MikelManson marked it as to-read Jun 01, BradleyPeter L. Operations Research 37 5: Published September 23rd by Wiley-Interscience first published September 9th Formulations and valid inequalities for the node capacitated graph partitioning problem.
BibTeX records: Laurence A. Wolsey
WangLaurence A. My library Help Advanced Book Search.
There are no discussion topics on this book yet. Fractional covers for forests and matchings.
Reformulation and Decomposition of Integer Programs. A tight formulation for uncapacitated lot-sizing with stock upper bounds. A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem.
Jungers lauence, Guillaume VankeerberghenLaurence A. Computational experience with benchmark instances. Algorithms and reformulations for lot sizing problems.
Wiley Encyclopedia of Computer Science and Engineering Maurice QueyranneLaurence Wolsey: Valid inequalities for knapsacks and mips with generalised upper bound constraints.
No eBook available Amazon. An analysis of approximations for maximizing submodular set functions – I. LieblingDenis NaddefGeorge L.
An analysis of the greedy algorithm for the submodular set covering problem. The Mixing Set with Divisible Capacities. Single-item reformulations for a vendor managed inventory routing problem: Mehdi Davood marked it as to-read Jan 10, Refresh and try again. Non-standard approaches to integer programming.