Mixed integer linear programming models for combinatorial optimization problems
From MaRDI portal
Recommendations
- Mixed integer linear programming formulation techniques
- Stronger formulations of mixed integer linear programs: an example
- scientific article; zbMATH DE number 2080319
- Integer programming problems using a polynomial number of variables and constraints for combinatorial optimization problems in graphs
- Algorithms for hybrid MILP/CP models for a class of optimization problems
Cited in
(6)- Solving mixed integer bilinear problems using MILP formulations
- How to select a small set of diverse solutions to mixed integer programming problems
- A recombination‐based matheuristic for mixed integer programming problems with binary variables
- Mixed integer linear programming formulation techniques
- An Algorithm Model for Mixed Variable Programming
- Computationally attractive nonlinear models for combinatorial optimisation
This page was built for publication: Mixed integer linear programming models for combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3081836)
