The following pages link to (Q4735935):
Displaying 18 items.
- On \(t\)-branch split cuts for mixed-integer programs (Q378102) (← links)
- Models and algorithms to improve earthwork operations in road design using mixed integer linear programming (Q421690) (← links)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
- Coefficient strengthening: a tool for reformulating mixed-integer programs (Q847848) (← links)
- General purpose heuristics for integer programming. I (Q1365114) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Multi-warehouse package consolidation for split orders in online retailing (Q2029283) (← links)
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods (Q2219510) (← links)
- Nutmeg: a MIP and CP hybrid solver using branch-and-check (Q2226478) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- Models and algorithms for three-stage two-dimensional bin packing (Q2643961) (← links)
- MIP: Theory and practice -- closing the gap (Q2712822) (← links)
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition (Q4427317) (← links)
- Decomposition Branching for Mixed Integer Programming (Q5095180) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
- Presolving linear bilevel optimization problems (Q6169995) (← links)
- A combined variable aggregation presolving technique for mixed integer programming (Q6564293) (← links)
