Pages that link to "Item:Q1306346"
From MaRDI portal
The following pages link to Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346):
Displayed 12 items.
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- An improved Benders decomposition applied to a multi-layer network design problem (Q1038109) (← links)
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
- The multi-layered network design problem (Q2370332) (← links)
- Solving a capacitated hub location problem (Q2384615) (← links)
- Optimal solution of the discrete cost multicommodity network design problem (Q2518654) (← links)
- Accelerating Benders method using covering cut bundle generation (Q3563624) (← links)
- Portfolio Selection under Piecewise Affine Transaction Costs: An Integer Quadratic Formulation (Q3627693) (← links)