Minimum‐cost flow problems having arc‐activation costs
From MaRDI portal
(Redirected from Minimum‐cost flow problems having arc‐activation costs)
Recommendations
Cites work
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- A dynamic network flow model for interdependent infrastructure and supply chain networks with uncertain asset operability
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- A genetic algorithm for solving the fixed-charge transportation model: two-stage problem
- A local branching heuristic for the capacitated fixed-charge network design problem
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- A reduced-cost iterated local search heuristic for the fixed-charge transportation problem
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
- An uncertain two-echelon fixed charge transportation problem
- Analysis of a flow problem with fixed charges
- Approximate solutions of capacitated fixed-charge minimum cost network flow problems
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Cancel-and-tighten algorithm for quickest flow problems
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- Continuous-Time Flows in Networks
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network
- Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- Earliest Arrival Flows with Multiple Sources
- Efficient continuous-time dynamic network flow algorithms
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- Fixed-charge transportation problem: facets of the projection polyhedron
- Flow pack facets of the single node fixed-charge flow polytope
- Flows over Time with Load-Dependent Transit Times
- Generalized Subtour Elimination Constraints and Connectivity Constraints
- scientific article; zbMATH DE number 4027150 (Why is no real title available?)
- scientific article; zbMATH DE number 2086912 (Why is no real title available?)
- scientific article; zbMATH DE number 1836457 (Why is no real title available?)
- Improving Discrete Model Representations via Symmetry Considerations
- Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- Maximum-throughput dynamic network flows
- Minimum Convex Cost Dynamic Network Flows
- Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
- Minimum-cost dynamic flows: The series-parallel case
- On solving quickest time problems in time-dependent, dynamic networks
- Path cover and path pack inequalities for the capacitated fixed-charge network flow problem
- Quickest Flows Over Time
- Robust flows over time: models and complexity results
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Simultaneous evacuation and entrance planning in complex building based on dynamic network flows
- Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
- Solving to optimality the uncapacitated fixed-charge network flow problem
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
- Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach
- Submodularity and valid inequalities in capacitated fixed charge networks
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
Cited in
(5)- scientific article; zbMATH DE number 1696527 (Why is no real title available?)
- A mean-variance model for the minimum cost flow problem with stochastic arc costs
- Minimum cost flow in a network with an overestimated arc capacity
- Dynamic reversible lane optimization in autonomous driving environments: balancing efficiency and safety
- Mixed-integer programming models and heuristic algorithms for the maximum value dynamic network flow scheduling problem
This page was built for publication: Minimum‐cost flow problems having arc‐activation costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6077360)
