The nonnegative node weight j-restricted k-matching problems
Year of publication: |
2014
|
---|---|
Authors: | Li, Yanjun |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 39.2014, 3, p. 930-948
|
Subject: | k-matching | polynomial-time algorithm | min-max theorem | NP-completeness |
-
A min-max theorem for the minimum fleet-size problem
Ye, Tinghan, (2023)
-
An exterior point polynomial-time algorithm for convex quadratic programming
Tian, Da, (2015)
-
Maximum-cover source location problems with objective edge-connectivity three
Sugihara, Kenya, (2009)
- More ...
-
Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts
Andersen, Kent, (2005)
-
Inverse Matroid Intersection Problem
Mao-Cheng, Cai, (1997)
-
Inverse Matroid Intersection Problem
Mao-Cheng, Cai, (1997)
- More ...