Pages that link to "Item:Q1842419"
From MaRDI portal
The following pages link to Dual network bounds for integer programming problems of a special form (Q1842419):
Displaying 7 items.
- Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
- A possible way to reduce degeneracy in integer programming computations (Q1104240) (← links)
- Using dual network bounds in algorithms for solving generalized set packing/partitioning problems (Q1814995) (← links)
- A monotonic, dual-based bounding procedure for integer programs (Q1894724) (← links)
- Network Formulations of Mixed-Integer Programs (Q3169026) (← links)
- A bounded dual (all-integer) integer programming algorithm with an objective cut (Q3316963) (← links)
- BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES (Q5694062) (← links)