Pages that link to "Item:Q1854755"
From MaRDI portal
The following pages link to Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach (Q1854755):
Displayed 11 items.
- Cost-based decision-making in middleware virtualization environments (Q531466) (← links)
- On interval-subgradient and no-good cuts (Q613320) (← links)
- Transshipment service through crossdocks with both soft and hard time windows (Q763197) (← links)
- Approximated consistency for the automatic recording constraint (Q1010285) (← links)
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
- Optimization models for forest road upgrade planning (Q2369960) (← links)
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements (Q2468776) (← links)
- Lower bounds from state space relaxations for concave cost network flow problems (Q2494472) (← links)
- A branch-and-bound algorithm for concave network flow problems (Q2494473) (← links)
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
- Logic-based MultiObjective Optimization for Restoration Planning (Q3638509) (← links)
