Surrogate "Level-Based" Lagrangian Relaxation for Mixed-Integer Linear Programming (original) (raw)
Related papers
Computational advances in solving Mixed Integer Linear Programming problems
2018
Mixed Integer Linear Programming Formulation Techniques
SIAM Review, 2015
Mixed-integer nonlinear optimization
Acta Numerica, 2013
An algorithmic framework for convex mixed integer nonlinear programs
Discrete Optimization, 2008
A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints
Siam Journal on Optimization, 2021
Mixed-Integer Linear Programming Formulations
Heuristics for convex mixed integer nonlinear programs
Computational Optimization and Applications, 2012
Decomposition Methods for Integer Linear Programming
2010
Dynamic Lagrangian dual and reduced RLT constructs for solving 0–1 mixed-integer programs
TOP, 2011
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
INFORMS Journal on Computing, 2000
FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
2010
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Lecture Notes in Computer Science, 2010
Annals of Operations Research, 1986
Faster integer-feasibility in mixed-integer linear programs by branching to force change
Computers & Operations Research, 2011
Narrow Gauge and Analytical Branching Strategies for Mixed Integer Programming
2015
Automatic Dantzig-Wolfe Reformulation of Mixed Integer Programs
An Exact Penalty Approach for Mixed Integer Nonlinear Programming Problems
American Journal of Operations Research, 2011
Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
Discrete Optimization, 2004
A Decomposition Technique For Solving Integer Programming Problems
GANIT: Journal of Bangladesh Mathematical Society, 2014
A New Subadditive Approach to Integer Programming: Theory and Algorithms
Integer set reduction for stochastic mixed-integer programming
Computational Optimization and Applications
An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
Computational Optimization and Applications, 2014
A New Approach to the Feasibility Pump in Mixed Integer Programming *
2020
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
Mathematical Programming, 2007
Valid inequalities and reformulation techniques for Mixed Integer Nonlinear Programming
2015
Generation of a reduced first-level mixed integer programming problem
Modern branch-and-cut solvers for Mixed-Integer Linear Programming: a computational comparison
2015
A Hybrid Branch-and-Bound Approach for Exact Rational Mixed-Integer Programming
Mixed logical-linear programming
Discrete Applied Mathematics, 1999
Automated Configuration of Mixed Integer Programming Solvers
Frank Hutter, Kevin Leyton-brown, Holger Hoos
Lecture Notes in Computer Science, 2010
An optimality cut for mixed integer linear programs
European Journal of Operational Research, 1999
Lagrangean decomposition for integer programming : theory and applications
RAIRO - Operations Research, 1987
Coefficient strengthening: a tool for reformulating mixed-integer programs
Mathematical Programming, 2010