scientific article; zbMATH DE number 2084777
From MaRDI portal
Publication:4735935
zbMath1052.90049MaRDI QIDQ4735935
Publication date: 9 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2241/22410001.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (9)
Coefficient strengthening: a tool for reformulating mixed-integer programs ⋮ Models and algorithms for three-stage two-dimensional bin packing ⋮ Models and algorithms to improve earthwork operations in road design using mixed integer linear programming ⋮ Presolving linear bilevel optimization problems ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Complexity evaluation of benchmark instances for the \(p\)-median problem ⋮ Two-row and two-column mixed-integer presolve using hashing-based pairing methods ⋮ Multi-warehouse package consolidation for split orders in online retailing ⋮ A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
Uses Software
This page was built for publication:
