On generalized surrogate duality in mixed-integer nonlinear programming
From MaRDI portal
Publication:2118119
DOI10.1007/S10107-021-01691-6zbMATH Open1489.90069OpenAlexW2990034365MaRDI QIDQ2118119FDOQ2118119
Authors: Benjamin Müller, Gonzalo Muñoz, Maxime Gasse, Ambros M. Gleixner, Andrea Lodi, Felipe Serrano 
Publication date: 22 March 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-021-01691-6
Recommendations
- On generalized surrogate duality in mixed-integer nonlinear programming
- Mixed-integer nonlinear optimization
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- On branching rules for convex mixed-integer nonlinear optimization
Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Mixed integer programming (90C11)
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- SCIP: solving constraint integer programs
- Trust Region Methods
- Stabilized column generation
- The Cutting-Plane Method for Solving Convex Programs
- Title not available (Why is that?)
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Title not available (Why is that?)
- Disjunctive programming: Properties of the convex hull of feasible points
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Surrogate Mathematical Programming
- Enhancing RLT relaxations via a new class of semidefinite cuts
- On mathematical programming with indicator constraints
- Surrogate duality relaxation for job shop scheduling
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Surrogate Constraint Duality in Mathematical Programming
- Surrogate Constraints
- A global optimization algorithm for linear fractional and bilinear programs
- Feasibility-based bounds tightening via fixed points
- Symmetry in integer linear programming
- Title not available (Why is that?)
- On the choice of explicit stabilizing terms in column generation
- Experiments in mixed-integer linear programming
- An Aggregate Constraint Method for Non-Linear Programming
- Necessary and sufficient constraint qualification for surrogate duality
- Surrogate Programming and Multipliers in Quasi-convex Programming
- Discrete Programming by the Filter Method
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Lagrangean/surrogate relaxation for generalized assignment problems
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Some relationships between lagrangian and surrogate duality in integer programming
- Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Tutorial on surrogate constraint approaches for optimization in graphs
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Calculating surrogate constraints
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Surrogate duality in a branch-and-bound procedure for integer programming
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
- AN IMPROVED SURROGATE CONSTRAINTS METHOD FOR SEPARABLE NONLINEAR INTEGER PROGRAMMING
- Title not available (Why is that?)
- Surrogate duality in a branch-and-bound procedure
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Small and strong formulations for unions of convex sets from the Cayley embedding
Cited In (2)
Uses Software
This page was built for publication: On generalized surrogate duality in mixed-integer nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118119)
