An approach for the optimal solution of MILP problems

MaRDI QIDQ2935958zbMATH OpenFDO

Authors P. V. Ubale

Publication date 30 December 2014

zbMATH Keywords

B \& B paradigmdiscrete optimization problemmixed integer programming problem

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• An algorithm for mixed integer optimization
• scientific article; zbMATH DE number 4070632
• scientific article; zbMATH DE number 1488891
• An algorithm for multiparametric mixed-integer linear programming problems
• An intelligent algorithm for mixed-integer programming models

Cited in

(9)

• An algorithm for mixed integer optimization
• A two-phase optimization procedure for integer programming problems
• A MILP model for an extended version of the flexible job shop problem
• Solving mixed integer bilinear problems using MILP formulations
• Achieving MILP feasibility quickly using general disjunctions
• MILP-based heuristics for the design of rural community electrification projects
• MILP formulation for solving minimum time optimal control problems
• MILP-Formulations for the Total Adjustment Cost Problem
• Accelerated MILP-strategies for the optimal operation planning of energy supply system

This page was built for publication: An approach for the optimal solution of MILP problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935958)