Pages that link to "Item:Q3827774"
From MaRDI portal
The following pages link to Analysis of a flow problem with fixed charges (Q3827774):
Displaying 29 items.
- Budget-constrained minimum cost flows (Q281825) (← links)
- Single source single-commodity stochastic network design (Q373182) (← links)
- Tree network design avoiding congestion (Q646180) (← links)
- Optimization of interdependent nonhomogeneous flows with interacting fixed charges (Q808987) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage (Q827111) (← 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)
- The interactive fixed charge inhomogeneous flows optimization problem (Q1173721) (← 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)
- Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure (Q2147939) (← 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)
- Approximability of capacitated network design (Q2354026) (← links)
- Network design and flow problems with cross-arc costs (Q2482771) (← 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)
- Solving biobjective network flow problem associated with minimum cost-time loading (Q3389544) (← links)
- A relaxation/decomposition algorithm for the fixed charged network problem (Q3478275) (← links)
- Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)
- Avoiding unnecessary demerging and remerging of multi‐commodity integer flows (Q6092659) (← links)
- Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks (Q6160230) (← links)
- Road network, landing location, and routing optimization for forest smallholders landscapes (Q6659117) (← links)
