Zero duality gap in surrogate constraint optimization: a concise review of models
From MaRDI portal
Publication:2255935
DOI10.1016/j.ejor.2013.04.023zbMath1305.90001MaRDI QIDQ2255935
Publication date: 18 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.04.023
90C30: Nonlinear programming
90C46: Optimality conditions and duality in mathematical programming
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Three algorithms for graph locally harmonious colouring, On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, On generalized surrogate duality in mixed-integer nonlinear programming, Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution, Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A gradient-based approach for discrete optimum design
- How effective is aggregation for solving 0-1 models?
- A smoothing method for zero--one constrained extremum problems
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
- A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation
- An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
- Surrogate constraint normalization for the set covering problem
- A truncated aggregate smoothing Newton method for minimax problems
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method
- Simple and fast surrogate constraint heuristics for the maximum independent set problem
- Development of a new approach for deterministic supply chain network design
- A surrogate cutting plane algorithm for all-integer programming
- Surrogate duality in a branch-and-bound procedure for integer programming
- Aggregation of constraints in integer programming
- On the entropic regularization method for solving min-max problems with applications
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
- Tutorial on surrogate constraint approaches for optimization in graphs
- Entropic perturbation method for solving a system of linear inequalities
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
- Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
- Lagrangean/surrogate relaxation for generalized assignment problems
- Convexification and existence of a saddle point in a \(p\)th-power reformulation for nonconvex constrained optimization.
- New results for aggregating integer-valued equations
- Mixed logical-linear programming
- Towards strong duality in integer programming
- Generalized nonlinear Lagrangian formulation for bounded integer programming
- Logic, Optimization, and Constraint Programming
- Algorithms for the Bin Packing Problem with Conflicts
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Surrogate Constraints Algorithm for Reliability Optimization Problems with Multiple Constraints
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function
- A Min-Max-Sum Resource Allocation Problem and Its Applications
- Polynomial-Time Aggregation of Integer Programming Problems
- Aggregating assignment constraints
- A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation
- Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems
- Surrogate Constraints Algorithm for Reliability Optimization Problems with Two Constraints
- Calculating surrogate constraints
- Surrogate Constraints in Integer Programming
- An Aggregate Constraint Method for Non-Linear Programming
- Surrogate Constraint Duality in Mathematical Programming
- Technical Note—An Implementation of Surrogate Constraint Duality
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
- A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
- A general saddle point result for constrained optimization
- AN IMPROVED SURROGATE CONSTRAINTS METHOD FOR SEPARABLE NONLINEAR INTEGER PROGRAMMING
- An overview of heuristic solution methods
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Quasi-Convex Programming
- Surrogate Mathematical Programming
- Aggregating diophantine equations
- A note on equivalent systems of linear diophantine equations
- Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
- \(p\)th power Lagrangian method for integer programming
- The aggregate constraint homotopy method for nonconvex nonlinear programming
