The partitioning min-max weighted matching problem

DOI10.1016/j.ejor.2015.06.041zbMath1346.90785OpenAlexW604349601MaRDI QIDQ320079

Sebastian Meiswinkel, Erwin Pesch, Dominik Kress

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.06.041

zbMATH Keywords

partitioningbipartite graphmaximum matchingassignmentcontainer transshipment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

A weighted perfect matching with constraints on weights of its parts, Solving the single crane scheduling problem at rail transshipment yards, Socially fair matching: exact and approximation algorithms, Levelling crane workload in multi-yard rail-road container terminals, Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas

Cites Work

• Unnamed Item
• Unnamed Item
• Effects of storage block layout and automated yard crane systems on the performance of seaport container terminals
• Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
• Multiprocessor scheduling: Combining LPT and MULTIFIT
• Determining crane areas in intermodal transshipment yards: the yard partition problem
• Assignment Problems
• An approach to determine storage locations of containers at seaport terminals