MILP-Formulations for the Total Adjustment Cost Problem

DOI10.1007/978-3-319-00795-3_61MaRDI QIDQ5171822zbMATH OpenOpenAlexFDO

Authors Stefan Kreter, Julia Rieck, Jürgen Zimmermann

Publication date 12 February 2015

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-00795-3_61

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Recommendations

• An approach for the optimal solution of MILP problems
• The total adjustment cost problem: applications, models, and solution algorithms
• MILP formulation for solving minimum time optimal control problems
• Solving mixed integer bilinear problems using MILP formulations
• The MILP-relaxation approach
• A MILP formulation for generalized geometric programming using piecewise-linear approximations
• Compact MILP formulations for the \(p\)-center problem
• Global optimization of multi-parametric MILP problems
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• On the adjustment problem for linear programs

Cited in

(3)

• The total adjustment cost problem: applications, models, and solution algorithms
• MILP formulation for solving minimum time optimal control problems
• Mixed-integer linear programming for resource leveling problems

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: MILP-Formulations for the Total Adjustment Cost Problem

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