The partitioning min-max weighted matching problem
DOI10.1016/J.EJOR.2015.06.041zbMATH Open1346.90785OpenAlexW604349601MaRDI QIDQ320079FDOQ320079
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
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
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Assignment Problems
- Title not available (Why is that?)
- Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
- An approach to determine storage locations of containers at seaport terminals
- Multiprocessor scheduling: Combining LPT and MULTIFIT
- 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
Cited In (8)
- Socially fair matching: exact and approximation algorithms
- Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
- 3-partitioning problems for maximizing the minimum load
- 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
- A weighted perfect matching with constraints on weights of its parts
- Solving the single crane scheduling problem at rail transshipment yards
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)
