Calculating surrogate constraints
From MaRDI portal
Cites work
- A Modified Linear Program for Columnar Methods in Mathematical Programming
- A Review of Quasi-Convex Functions
- Bottleneck Linear Programming
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Generalized Linear Programming Solves the Dual
- scientific article; zbMATH DE number 3435272 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- Quasi-Convex Programming
- Some relationships between lagrangian and surrogate duality in integer programming
- Surrogate Constraint Duality in Mathematical Programming
- Surrogate Constraints
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Surrogate duality in a branch-and-bound procedure
- Surrogate Mathematical Programming
- Technical Note—Computational Experience with Normed and Nonnormed Column-Generation Procedures in Nonlinear Programming
- Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
- The Generalized Penalty-Function/Surrogate Model
- The Generalized Slack Variable Linear Program
- Transformation of integer programs to knapsack problems
- Validation of subgradient optimization
Cited in
(39)- Development of a new approach for deterministic supply chain network design
- Zero-one integer programs with few contraints - lower bounding theory
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- Surrogate duality in a branch-and-bound procedure for integer programming
- A hybrid method for solving nonlinear knapsack problems
- Surrogate duality relaxation for job shop scheduling
- The design of multiactivity multifacility systems
- Relaxation heuristics for a generalized assignment problem
- An enumerative algorithm framework for a class of nonlinear integer programming problems
- Algorithms for large scale set covering problems
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- A surrogate heuristic for set covering problems
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
- The multidimensional 0-1 knapsack problem: an overview.
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Lagrangean/surrogate relaxation for generalized assignment problems
- On generalized surrogate duality in mixed-integer nonlinear programming
- Zero duality gap in surrogate constraint optimization: a concise review of models
- Inexact subgradient methods for quasi-convex optimization problems
- Hybrid approaches for the two-scenario max-min knapsack problem
- Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning»
- 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
- Quasiconvex duality theory by generalized conjugation methods
- On generalized surrogate duality in mixed-integer nonlinear programming
- Surrogate dual method for multi-dimensional nonlinear knapsack problems
- Solving large-scale linear programs by aggregation
- 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
- An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints
- All-integer global optimization for high-dimensional sparse regression, with applications in financial and genomic data
- On duality for Boolean programming
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Fractional programming by lower subdifferentiability techniques
- A surrogate and Lagrangian approach to constrained network problems
- Surrogate constraint normalization for the set covering problem
This page was built for publication: Calculating surrogate constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3916382)
