scientific article; zbMATH DE number 2084777

MaRDI QIDQ4735935zbMATH OpenFDO

Authors Alexander Martin

Publication date 9 August 2004

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

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mixed integer programming (90C11)

Recommendations

• scientific article; zbMATH DE number 1488891
• A branch-and-cut algorithm for mixed-integer bilinear programming
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization
• A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
• Exploring the numerics of branch-and-cut for mixed integer linear optimization
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
• Mixed integer programming computation
• Classical cuts for mixed-integer programming and branch-and-cut
• Classical cuts for mixed-integer programming and branch-and-cut

Cited in

(20)

• Classical cuts for mixed-integer programming and branch-and-cut
• Exploring the numerics of branch-and-cut for mixed integer linear optimization
• A combined variable aggregation presolving technique for mixed integer programming
• Two-row and two-column mixed-integer presolve using hashing-based pairing methods
• Coefficient strengthening: a tool for reformulating mixed-integer programs
• Nutmeg: a MIP and CP hybrid solver using branch-and-check
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
• Models and algorithms to improve earthwork operations in road design using mixed integer linear programming
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• Multi-warehouse package consolidation for split orders in online retailing
• On t-branch split cuts for mixed-integer programs
• Complexity evaluation of benchmark instances for the \(p\)-median problem
• Decomposition Branching for Mixed Integer Programming
• Presolving linear bilevel optimization problems
• scientific article; zbMATH DE number 1538621 (Why is no real title available?)
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• Domain reduction techniques for global NLP and MINLP optimization
• MIP: Theory and practice -- closing the gap
• Models and algorithms for three-stage two-dimensional bin packing

Describes a project that uses

Uses Software

• MINTO
• MIPLIB
• ABACUS

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 Q4735935)