Abstract
We present and compare procedures for the approximate solution of the weighted matching problem with side constraints. The approaches are based on Lagrangean relaxation as well as on Lagrangean decomposition. Furthermore we develop an enumerative approach to solve this class of problems exactly. Our computational experiments investigate the efficiency of the relaxation and decompostion method for this lass of problems and are especially focusing on the comparison of different “subgradient methods” for solving the Lagrangean dual.
This work was partially supported by a grant from the Deutsche Forschungsgemeinschaft (DFG)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ball M.O., Benoit H. [ 1988 ]: A Lagrangean Relaxation Based Heuristic for the Urban Transit Crew Scheduling Problem. Lecture Notes in Economics and Mathematical Systems 308, 54–67.
Ball M.O., Derigs U., Hilbrand C., Metz A. [ 1990 ]: Matching Problems with Generalized Upper Bounds Side Constraints. Networks, Vol. 20, 703–721.
Camerini P., Vercellis C. [ 1981 ]: The Matroidal Knapsack: A Class of (often) Well-Solvable Problems. Operations Research Letters 3, 157–162.
Derigs U. [ 1985 ]: Some Basic Exchange Properties in Combinatorial Optimization to Construct the k—best Solutions. Discrete Appl. Math. 11, 129–141.
Derigs U., Metz A. [ 1990 ]: On the Construction of the Set of k-Best Matchings and their use in Solving Constrained Matching Problems. Working Paper.
Derigs U., Metz A. [ 1991 ]: A Matching Based Approach for Solving the Delivery/Pick-up Vehicle Routing Problem with Time Windows. Working Paper.
Edmonds J. [ 1965 ]: Maximum matching and a polyhedron with 0,1 vertices. Journal of Research of the National Bureau Standards 69B, 125–130.
Fisher M.L. [ 1981 ]: The Lagrangean Relaxation Method for Solving Integer Programming Problems. Management Sci. 27, 1–18.
Fisher M. [ 1987 ]: System Design for Express Airlines. Doctorial Dissertation in Flight Transportation, Massachusetts Institute of Technology.
Geoffrion A. [ 1974 ]: Lagrangean Relaxation and its Use in Integer Programming. Mathematical Programming Study 2, 82–114.
Guignard M., Kim S. [ 1987 ]: Lagrangean Decomposition: A Model yielding stronger Lagrangean Bounds. Mathematical Prog. 39, 215–228.
Jörnsten K., Näsberg M. [ 1986 ]: A new Lagrangean Approach to the generalized Assignment Problem. European Journal of Operational Research 27, 313–323.
Kim S. [ 1985 ]: Primal Interpretation of Lagrangean Decomposition. Department of Statistics Report 72, University of Pennsylvania.
Martello S., Toth P. [ 1988 ]: A new Algorithm for the 0–1 Knapsack Problem. Management Sci. 34, 633–644.
Neinhauser G.L., Weber G. [ 1979 ]: Optimal Set Partitioning, Matching and Lagrangean Duality. Naval Res. Logistics Q.26, 553–563.
Poljak B.T. [ 1967 ]: A General Method for Solving Extremum Problems. Soviet. Math. Dokl. 8, 593–597.
Zowe J. [1987]: Optimization with Nonsmooth Data. OR Spektrum 9, 195–201.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Derigs, U., Metz, A. (1992). Matching problems with Knapsack side constraints. In: Krabs, W., Zowe, J. (eds) Modern Methods of Optimization. Lecture Notes in Economics and Mathematical Systems, vol 378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02851-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-02851-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55139-3
Online ISBN: 978-3-662-02851-3
eBook Packages: Springer Book Archive