On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming
From MaRDI portal
Publication:5041755
DOI10.1007/978-3-030-45771-6_25zbMath1503.90083arXiv1912.00356OpenAlexW3021111117MaRDI QIDQ5041755
Andrea Lodi, Benjamin Müller, Maxime Gasse, Ambros M. Gleixner, Gonzalo Muñoz, Felipe Serrano
Publication date: 14 October 2022
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.00356
Mixed integer programming (90C11) Optimality conditions and duality in mathematical programming (90C46)
Related Items
On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations, Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity, Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- bliss
- Enhancing RLT relaxations via a new class of semidefinite cuts
- SCIP: solving constraint integer programs
- On the choice of explicit stabilizing terms in column generation
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- Surrogate duality relaxation for job shop scheduling
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Stabilized column generation
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
- Tutorial on surrogate constraint approaches for optimization in graphs
- Lagrangean/surrogate relaxation for generalized assignment problems
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- A global optimization algorithm for linear fractional and bilinear programs
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Small and strong formulations for unions of convex sets from the Cayley embedding
- On mathematical programming with indicator constraints
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- The Cutting-Plane Method for Solving Convex Programs
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Some relationships between lagrangian and surrogate duality in integer programming
- Calculating surrogate constraints
- An Aggregate Constraint Method for Non-Linear Programming
- Surrogate Constraint Duality in Mathematical Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- AN IMPROVED SURROGATE CONSTRAINTS METHOD FOR SEPARABLE NONLINEAR INTEGER PROGRAMMING
- Trust Region Methods
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Discrete Programming by the Filter Method
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Surrogate Constraints
- Surrogate Mathematical Programming
