The partitioning min-max weighted matching problem

DOI10.1016/J.EJOR.2015.06.041MaRDI QIDQ320079zbMATH OpenOpenAlexFDO

Authors Dominik Kress, Sebastian Meiswinkel, Erwin Pesch

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

assignmentbipartite graphcontainer transshipmentmaximum matchingpartitioning

Mathematics Subject Classification ID

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

Recommendations

• Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
• A weighted perfect matching with constraints on weights of its parts
• On combinatorial optimization and mechanism design problems arising at container ports. With a foreword by Prof. Dr. Erwin Pesch
• Decomposition algorithms for solving the minimum weight maximal matching problem
• A note on the weighted matching with penalty problem

Cites work

• An approach to determine storage locations of containers at seaport terminals
• Assignment Problems
• Determining crane areas in intermodal transshipment yards: the yard partition problem
• Effects of storage block layout and automated yard crane systems on the performance of seaport container terminals
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
• Multiprocessor scheduling: Combining LPT and MULTIFIT

Cited in

(10)

• An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
• 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
• Solving the single crane scheduling problem at rail transshipment yards
• Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
• A weighted perfect matching with constraints on weights of its parts
• Socially fair matching: exact and approximation algorithms
• Fair and efficient graphical resource allocation with matching-induced utilities
• Multiple parallel-batch machines scheduling with additive resource assignment and machine available times
• 3-partitioning problems for maximizing the minimum load

This page was built for publication: The partitioning min-max weighted matching problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320079)