The following pages link to Calculating surrogate constraints (Q3916382):
Displaying 38 items.
- Solving large-scale linear programs by aggregation (Q581234) (← links)
- An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints (Q675985) (← links)
- On duality for Boolean programming (Q750292) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Fractional programming by lower subdifferentiability techniques (Q911479) (← links)
- A surrogate and Lagrangian approach to constrained network problems (Q920831) (← links)
- Surrogate constraint normalization for the set covering problem (Q976352) (← links)
- Development of a new approach for deterministic supply chain network design (Q1027594) (← links)
- Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems (Q1067997) (← links)
- Surrogate duality in a branch-and-bound procedure for integer programming (Q1099783) (← links)
- A hybrid method for solving nonlinear knapsack problems (Q1123129) (← links)
- Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
- The design of multiactivity multifacility systems (Q1171982) (← links)
- Relaxation heuristics for a generalized assignment problem (Q1278258) (← links)
- An enumerative algorithm framework for a class of nonlinear integer programming problems (Q1278943) (← links)
- Algorithms for large scale set covering problems (Q1309874) (← links)
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem (Q1309925) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach (Q1389081) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- Zero duality gap in surrogate constraint optimization: a concise review of models (Q2255935) (← links)
- Inexact subgradient methods for quasi-convex optimization problems (Q2629635) (← links)
- Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
- Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning» (Q3035139) (← links)
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (Q3688105) (← links)
- On the complexity of the surrogate dual of 0–1 programming (Q3725870) (← links)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005) (← links)
- Quasiconvex duality theory by generalized conjugation methods (Q3824934) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- Surrogate dual method for multi-dimensional nonlinear knapsack problems (Q5456301) (← links)
- A simple procedure for solving a continuous quadratic mathematical model. (Q5931607) (← links)
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations (Q6670500) (← links)
