Pages that link to "Item:Q3854930"
From MaRDI portal
The following pages link to Some relationships between lagrangian and surrogate duality in integer programming (Q3854930):
Displaying 33 items.
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- On duality for Boolean programming (Q750292) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- A trust region method for the solution of the surrogate dual in integer programming (Q896175) (← 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)
- A new Lagrangian relaxation approach to the generalized assignment problem (Q1088908) (← links)
- Surrogate duality in a branch-and-bound procedure for integer programming (Q1099783) (← links)
- The design of multiactivity multifacility systems (Q1171982) (← links)
- Relaxation heuristics for a generalized assignment problem (Q1278258) (← links)
- Algorithms for large scale set covering problems (Q1309874) (← links)
- On using approximations of the Benders master problem (Q1333479) (← 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)
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem (Q1577777) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- Zero duality gap in integer programming: \(P\)-norm surrogate constraint method (Q1807931) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
- Johri's general dual, the Lagrangian dual, and the surrogate dual (Q1847162) (← links)
- Dual-based heuristics for a hierarchical covering location problem (Q1869894) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem (Q2257610) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- Solving network design problems via iterative aggregation (Q2516352) (← 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)
- Calculating surrogate constraints (Q3916382) (← links)
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach (Q3948895) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- Searching for optimal integer solutions to set partitioning problems using column generation (Q5416769) (← links)
