Surrogate Constraint Duality in Mathematical Programming

Cited in

(65)

Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
On generalized surrogate duality in mixed-integer nonlinear programming
A surrogate-based heuristic for production planning problem of orders in small foundries
Matheuristics: survey and synthesis
A simple procedure for solving a continuous quadratic mathematical model.
Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
Constraint aggregation principle in convex optimization
An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core
A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem
Simple and fast surrogate constraint heuristics for the maximum independent set problem
Workface planning in synchronous production systems
Hybrid approaches for the two-scenario max-min knapsack problem
An improved reduction method for the robust optimization of the assignment problem
An enumerative algorithm framework for a class of nonlinear integer programming problems
A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism
A surrogate and Lagrangian approach to constrained network problems
The multidimensional 0-1 knapsack problem: an overview.
On the complexity of the surrogate dual of 0–1 programming
Some relationships between lagrangian and surrogate duality in integer programming
Revisiting surrogate relaxation for the multidimensional knapsack problem
On generalized surrogate duality in mixed-integer nonlinear programming
Development of a new approach for deterministic supply chain network design
A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
A solution procedure for general knapsack problems with a few constraints
Profit-based FMS dynamic part type selection over time for mid-term production planning
Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
Probabilistic diversification and intensification in local search for vehicle routing
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
Zero duality gap in surrogate constraint optimization: a concise review of models
Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
On surrogating 0-1 knapsack constraints
The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
Mixed logical-linear programming
Improved convergent heuristics for the 0-1 multidimensional knapsack problem
A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
Surrogate duality in a branch-and-bound procedure for integer programming
Surrogate duality relaxation for job shop scheduling
Johri's general dual, the Lagrangian dual, and the surrogate dual
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
A relax-and-cut algorithm for the set partitioning problem
A heuristic routine for solving large loading problems
Deterministic job-shop scheduling: Past, present and future
On using approximations of the Benders master problem
On the robust shortest path problem.
Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem
Calculating surrogate constraints
Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning»
Zero-one integer programs with few contraints - lower bounding theory
Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
On the augmented Lagrangian dual for integer programming
An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
State partitioning based linear program for stochastic dynamic programs: an invariance property
Surrogate constraint normalization for the set covering problem
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
A new approach based on the surrogating method in the project time compression problems
On the complexity of surrogate and group relaxation for integer linear programs
Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
A o(n logn) algorithm for LP knapsacks with GUB constraints
A note on constraint aggregation and value functions for two-stage stochastic integer programs
An enhanced logarithmic method for signomial programming with discrete variables

This page was built for publication: Surrogate Constraint Duality in Mathematical Programming

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