Pages that link to "Item:Q3896842"
From MaRDI portal
The following pages link to Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions (Q3896842):
Displaying 18 items.
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
- Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
- Correction to an article of Gavish and Pirkul (Q1194780) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Zero duality gap in integer programming: \(P\)-norm surrogate constraint method (Q1807931) (← links)
- On the complexity of surrogate and group relaxation for integer linear programs (Q2060595) (← links)
- Revisiting surrogate relaxation for the multidimensional knapsack problem (Q2102833) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- Distance confined path problem and separable integer programming (Q2841138) (← 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)
- Calculating surrogate constraints (Q3916382) (← links)
- Surrogate dual method for multi-dimensional nonlinear knapsack problems (Q5456301) (← links)
- Workface planning in synchronous production systems (Q5953343) (← links)
