Pages that link to "Item:Q4857783"
From MaRDI portal
The following pages link to Network Optimization Problems: Algorithms, Applications and Complexity (Q4857783):
Displayed 18 items.
- Finding the shortest paths by node combination (Q632873) (← links)
- Modeling reverse logistic tasks within closed-loop supply chains: an example from the automotive industry (Q819103) (← links)
- Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations (Q1342646) (← links)
- Optimal routing in a transportation network (Q1390277) (← links)
- Existence of general competitive equilibria: a variational approach (Q1669235) (← links)
- A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks (Q1758062) (← links)
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
- A novel approach to subgraph selection with multiple weights on arcs (Q2168723) (← links)
- An interactive approach for solving the multiobjective minimum cost flow problem in the fuzzy environment (Q2225554) (← links)
- A survey of combinatorial optimization problems in multicast routing (Q2387246) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Principles of cost minimisation in wireless networks (Q2573007) (← links)
- Parallel Solution Methods for Vehicle Routing Problems (Q3564355) (← links)
- Network optimization in supply chain management and financial engineering: An annotated bibliography (Q4434483) (← links)
- Complexity of general continuous minimization problems: a survey (Q5717540) (← links)
- Risk‐averse optimization and resilient network flows (Q6139370) (← links)
- Quasivariational inequalities for dynamic competitive economic equilibrium problems in discrete time (Q6156166) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)