Pages that link to "Item:Q3827774"
From MaRDI portal
The following pages link to Analysis of a flow problem with fixed charges (Q3827774):
Displayed 15 items.
- Tree network design avoiding congestion (Q646180) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems (Q853587) (← links)
- A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment (Q1011268) (← links)
- Optimal design of a distributed network with a two-level hierarchical structure (Q1203810) (← links)
- Solving to optimality the uncapacitated fixed-charge network flow problem (Q1265864) (← links)
- Algorithms for a multi-level network optimization problem (Q1307817) (← links)
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← 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)
- Cross-facility management of production and transportation planning problem (Q2499157) (← links)
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
- Memetic algorithms (Q2573010) (← links)
- On budget-constrained flow improvement. (Q2583570) (← links)