scientific article; zbMATH DE number 1953199

MaRDI QIDQ4414645zbMATH OpenFDO

Authors Jean-Philippe Richard, G. L. Nemhauser, I. R. jun. de Farias

Publication date 25 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2570/25700158.htm

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• The mixed cutting plane algorithm for all-integer programming
• A simple finite cutting plane algorithm for integer programs
• A branch-and-cut method for 0-1 mixed convex programming
• Cutting plane algorithms for \(0-1\) programming based on cardinality cuts

Cited in

(8)

• A finitely converging cutting plane technique
• The mixed cutting plane algorithm for all-integer programming
• Solving zero-one mixed integer programming problems using tabu search
• Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming
• scientific article; zbMATH DE number 1389085 (Why is no real title available?)
• A Facet Generation Procedure for Solving 0/1 Integer Programs
• The bounded simplex method to solve the 0-1 linear integer programming problem
• Cutting plane algorithms for \(0-1\) programming based on cardinality cuts

This page was built for publication:

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