default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Optimization, Volume 14
Volume 14, November 2014
- Philippe Chrétienne:
A polynomial algorithm for the two-connections variant of the tree p-median problem. 1-16 - Gruia Calinescu
:
Relay placement for two-connectivity. 17-33 - Adam S. Jobson, André E. Kézdy, Susan C. White:
Connected matchings in chordal bipartite graphs. 34-45 - Warren Adams, Lucas A. Waddell:
Linear programming insights into solvable cases of the quadratic assignment problem. 46-60 - Adam N. Letchford, Michael Malmros Sørensen:
A new separation algorithm for the Boolean quadric and cut polytopes. 61-71 - Shmuel Onn:
Huge multiway table problems. 72-77 - Mads Kehlet Jepsen, Bjørn Petersen, Simon Spoorendonk, David Pisinger:
A branch-and-cut algorithm for the capacitated profitable tour problem. 78-96 - Borzou Rostami, Federico Malucelli:
A revised reformulation-linearization technique for the quadratic assignment problem. 97-103 - Shmuel Wimer:
Easy and difficult exact covering problems arising in VLSI power reduction by clock gating. 104-110 - Trivikram Dokka, Yves Crama, Frits C. R. Spieksma:
Multi-dimensional vector assignment problems. 111-125 - Daniel Tuyttens, Arnaud Vandaele:
Towards an efficient resolution of printing problems. 126-146 - Vladimir G. Deineko, Bettina Klinz, Alexander Tiskin, Gerhard J. Woeginger:
Four-point conditions for the TSP: The complete complexity classification. 147-159 - Katarína Cechlárová, Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, Ioannis Mourtos, Eva Potpinková:
Pareto optimality in many-to-many matching problems. 160-169 - Cristina Bazgan, Morgan Chopin:
The complexity of finding harmless individuals in social networks. 170-182
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-22 02:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
