Pages that link to "Item:Q4161087"
From MaRDI portal
The following pages link to A Convergent Duality Theory for Integer Programming (Q4161087):
Displaying 17 items.
- Non-standard approaches to integer programming (Q697562) (← links)
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems (Q800229) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- Symmetric duality for disjunctive programming with absolute value functionals (Q1078070) (← links)
- Constructive dual methods for discrete programming (Q1101341) (← links)
- Convergent duality for the traveling salesman problem (Q1178716) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- A nonlinear Lagrangian dual for integer programming (Q1870020) (← links)
- Towards strong duality in integer programming (Q2501114) (← links)
- Generalized nonlinear Lagrangian formulation for bounded integer programming (Q2583181) (← links)
- Subadditive duality in multiobjective integer linear programming (Q2785389) (← links)
- Distance confined path problem and separable integer programming (Q2841138) (← links)
- Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning» (Q3035139) (← links)
- Efficient group cuts for integer programs (Q3205025) (← links)
- Integer programming duality: Price functions and sensitivity analysis (Q3908768) (← links)
- Multiple cost coefficients sensitivity theorems of integer linear optimization (Q5039396) (← links)
