Minimum‐cost flow problems having arc‐activation costs (Q6077360)

scientific article; zbMATH DE number 7751654

Language	Label	Description	Also known as
English	Minimum‐cost flow problems having arc‐activation costs	scientific article; zbMATH DE number 7751654

Statements

instance of

scholarly article

0 references

title

Minimum‐cost flow problems having arc‐activation costs (English)

0 references

0 references

0 references

Naval Research Logistics (NRL)

0 references

publication date

18 October 2023

0 references

zbMATH Keywords

consecutive flows

0 references

fixed-charge network flow problems

0 references

integer programming

0 references

minimum-cost flow problems

0 references

network flow optimization

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1002/nav.22006

0 references

cites work

Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron

0 references

Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems

0 references

Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network

0 references

Flow pack facets of the single node fixed-charge flow polytope

0 references

Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem

0 references

Earliest Arrival Flows with Multiple Sources

0 references

A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach

0 references

A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem

0 references

Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems

0 references

Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks

0 references

The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design

0 references

A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design

0 references

Solving to optimality the uncapacitated fixed-charge network flow problem

0 references

Q4782149

0 references

Q4737515

0 references

Quickest Flows Over Time

0 references

Efficient continuous-time dynamic network flow algorithms

0 references

Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design

0 references

Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design

0 references

Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design

0 references

A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure

0 references

Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints

0 references

A dynamic network flow model for interdependent infrastructure and supply chain networks with uncertain asset operability

0 references

Robust flows over time: models and complexity results

0 references

Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem

0 references

Analysis of a flow problem with fixed charges

0 references

Approximate solutions of capacitated fixed-charge minimum cost network flow problems

0 references

Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle

0 references

An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems

0 references

A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure

0 references

Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach

0 references

Minimum-cost dynamic flows: The series-parallel case

0 references

Flows over Time with Load-Dependent Transit Times

0 references

Generalized Subtour Elimination Constraints and Connectivity Constraints

0 references

Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation

0 references

A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem

0 references

On solving quickest time problems in time-dependent, dynamic networks

0 references

Q3768657

0 references

A parallel local search framework for the fixed-charge multicommodity network flow problem

0 references

Adaptive dynamic cost updating procedure for solving fixed charge network flow problems

0 references

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

0 references

Maximum-throughput dynamic network flows

0 references

Minimum Convex Cost Dynamic Network Flows

0 references

A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem

0 references

A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem

0 references

Continuous-Time Flows in Networks

0 references

A genetic algorithm for solving the fixed-charge transportation model: two-stage problem

0 references

Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems

0 references

A local branching heuristic for the capacitated fixed-charge network design problem

0 references

Cancel-and-tighten algorithm for quickest flow problems

0 references

Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach

0 references

An uncertain two-echelon fixed charge transportation problem

0 references

Improving Discrete Model Representations via Symmetry Considerations

0 references

Simultaneous evacuation and entrance planning in complex building based on dynamic network flows

0 references

Submodularity and valid inequalities in capacitated fixed charge networks

0 references

Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design

0 references

The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation

0 references

Identifiers

zbMATH Open document ID

1523.90066

0 references

DOI

10.1002/nav.22006

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6077360