Some relationships between lagrangian and surrogate duality in integer programming
From MaRDI portal
Cites work
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3435272 (Why is no real title available?)
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- Surrogate Constraint Duality in Mathematical Programming
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Surrogate Mathematical Programming
- Technical Note—Bounding Nonconvex Programs by Conjugates
- The Generalized Penalty-Function/Surrogate Model
- The Traveling-Salesman Problem and Minimum Spanning Trees
Cited in
(33)- Development of a new approach for deterministic supply chain network design
- Zero-one integer programs with few contraints - lower bounding theory
- A new Lagrangian relaxation approach to the generalized assignment problem
- Surrogate duality in a branch-and-bound procedure for integer programming
- The design of multiactivity multifacility systems
- Relaxation heuristics for a generalized assignment problem
- Algorithms for large scale set covering problems
- On using approximations of the Benders master problem
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
- The multidimensional 0-1 knapsack problem: an overview.
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
- Lagrangean/surrogate relaxation for generalized assignment problems
- Future paths for integer programming and links to artificial intelligence
- Johri's general dual, the Lagrangian dual, and the surrogate dual
- Dual-based heuristics for a hierarchical covering location problem
- On generalized surrogate duality in mixed-integer nonlinear programming
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- A survey on the continuous nonlinear resource allocation problem
- A relax-and-cut algorithm for the set partitioning problem
- Solving network design problems via iterative aggregation
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- On the complexity of the surrogate dual of 0–1 programming
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Calculating surrogate constraints
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- On generalized surrogate duality in mixed-integer nonlinear programming
- Searching for optimal integer solutions to set partitioning problems using column generation
- On duality for Boolean programming
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A trust region method for the solution of the surrogate dual in integer programming
This page was built for publication: Some relationships between lagrangian and surrogate duality in integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3854930)
