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