scientific article; zbMATH DE number 3972639
From MaRDI portal
Publication:3738932
Recommendations
Cited in
(20)- A meta-control algorithm for generating approximate solutions to binary integer programming problems
- An algorithm for multiparametric mixed-integer linear programming problems
- A relaxation algorithm for solving mixed integer programming problems
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
- A feasible rounding approach for mixed-integer optimization problems
- scientific article; zbMATH DE number 3847219 (Why is no real title available?)
- Aggregation and Mixed Integer Rounding to Solve MIPs
- A simple but NP-hard problem of mixed-discrete programming and its solution by approximate algorithms
- scientific article; zbMATH DE number 3976781 (Why is no real title available?)
- scientific article; zbMATH DE number 3978825 (Why is no real title available?)
- A mixed-integer linear programming problem which is efficiently solvable
- scientific article; zbMATH DE number 4074810 (Why is no real title available?)
- An Algorithm Model for Mixed Variable Programming
- An approximate algorithm for nonlinear integer programming
- An approximate algorithm for nonlinear integer programming
- A computational status update for exact rational mixed integer programming
- A recombination‐based matheuristic for mixed integer programming problems with binary variables
- From approximate to exact integer programming
- An algorithm of internal feasible directions for linear integer programming
- How to select a small set of diverse solutions to mixed integer programming problems
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 Q3738932)
