Experiments in integer programming

DOI10.1016/0166-218X(80)90053-0MaRDI QIDQ1137509zbMATH OpenOpenAlexFDO

Authors Ellis L. Johnson, Uwe H. Suhl

Publication date 1980

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(80)90053-0

zbMATH Keywords

hybrid algorithmcomputational studycomparison of algorithmscombination of branch-and-boundenumeration and cutting plane techniqueslarge scale zero-one integer programming problemsmixed-integer cuts

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Specification and verification (program logics, model checking, etc.) (68Q60) Boolean programming (90C09)

Cites work

• scientific article; zbMATH DE number 3643032 (Why is no real title available?)
• scientific article; zbMATH DE number 3427119 (Why is no real title available?)
• scientific article; zbMATH DE number 3692549 (Why is no real title available?)
• scientific article; zbMATH DE number 3526452 (Why is no real title available?)
• scientific article; zbMATH DE number 3578640 (Why is no real title available?)
• scientific article; zbMATH DE number 3331337 (Why is no real title available?)
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Direct Search Algorithms for Zero-One and Mixed-Integer Programming
• Discrete Programming by the Filter Method
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Integer Programming by Implicit Enumeration and Balas’ Method
• Investigation of some branch and bound strategies for the solution of mixed integer linear programs
• Partitioning procedures for solving mixed-variables programming problems
• Practical Solution of Large Mixed Integer Programming Problems with Umpire

Cited in

(8)

• Progress in presolving for mixed integer programming
• Two-row and two-column mixed-integer presolve using hashing-based pairing methods
• Large-scale mixed integer programming: Benders-type heuristics
• Verzweigungsstrategien in branch and bound-algorithmen für gemischt-ganzzahlige lineare 0-1-optimierungsanfgaben
• The knapsack problem with generalized upper bounds
• Multistage optimization with the help of quantified linear programming
• Presolve Reductions in Mixed Integer Programming
• An algorithm for solving fixed-charge problems using surrogate constraints

This page was built for publication: Experiments in integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1137509)