Minimum cost noncrossing flow problem on layered networks

DOI10.1016/j.dam.2018.09.016zbMath1418.90047OpenAlexW2898777864MaRDI QIDQ2414449

Yanyan Li

Publication date: 17 May 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.09.016

zbMATH Keywords

integer programmingnetwork flowslayered networksnoncrossing flow

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items

Minimum cost flow problem with conflicts, Maximum weight perfect matching problem with additional disjunctive conflict constraints, Maximum weighted matching with few edge crossings for 2-layered bipartite graph, Assignment problem with conflicts, Exact solution algorithms for the maximum flow problem with additional conflict constraints, Balanced-flow algorithm for path network planning in hierarchical spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
• The minimum cost perfect matching problem with conflict pair constraints
• The maximum flow problem with disjunctive constraints
• The minimum spanning tree problem with conflict constraints and its variations
• Paths, trees and matchings under disjunctive constraints
• The transportation problem with exclusionary side constraints
• A survey of berth allocation and quay crane scheduling problems in container terminals
• A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
• Container terminal operation and operations research -- a classification and literature review
• Layered graph approaches for combinatorial optimization problems
• A generalized classification scheme for crane scheduling with interference
• The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
• A branch and cut algorithm for minimum spanning trees under conflict constraints
• Finding Minimum-Cost Circulations by Successive Approximation
• Determining a Minimum Spanning Tree with Disjunctive Constraints
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems