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):||5 May 2014|
|PDF File Size:||12.45 Mb|
|ePub File Size:||14.52 Mb|
|Price:||Free* [*Free Regsitration Required]|
Formulations and valid inequalities for the node capacitated graph partitioning problem. Annals OR 1: Discrete Mathematics 7 Valid Inequalities and Superadditivity for Integer Programs.
Greg Werker rated it really liked it Mar 12, Discrete Mathematics Reformulation and Decomposition of Integer Programs. Integer and combinatorial optimization.
On discrete lot-sizing and scheduling on identical parallel machines. The Aussois workshop in combinatorial optimization introduction. Discrete Optimization 7 4: Elodie Massart marked it as to-read Dec 20, Marco Di SummaLaurence A. Alessandro added it Nov 04, Kaspar rated it liked it Mar 07, Hela added it Sep 10, Incorporating recent developments that have made it possible to solve difficult optimization problems with greater accuracy, author Laurence A.
Heuristic and Exact Algorithms. Computational experience with benchmark instances.
dblp: BibTeX records: Laurence A. Wolsey
Continuous knapsack sets with divisible capacities. Cutting planes for integer programs with general integer variables. Faces for a linear inequality in variables. Hardcoverpages.
WolseyMarshall L. Trish Gillett rated it really liked it May 06, Algorithms and reformulations for lot sizing problems. Annals OR 33 4: Waijing rated it really liked it Feb 28, Operations Research 27 4: No eBook available Amazon. Discrete Applied Mathematics 50 2: To ask other readers questions about Integer Programmingplease sign up. A tight formulation for uncapacitated lot-sizing with stock upper bounds.
Linus SchrageLaurence Wolsey: If you like books and love a.woley build cool products, we may be looking for you. These include improved modeling, cutting plane theory and algorithms, heuristic methods, and branch-and-cut and integer programming decomposition algorithms.
Two row mixed-integer cuts via lifting. Integer Programming by Laurence A. Manfred PadbergLaurence A. The continuous knapsack set.