default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHandbook of Combinatorial Optimization, 1999
- Ding-Zhu Du, Panos M. Pardalos:
Handbook of Combinatorial Optimization. Springer 1999, ISBN 978-1-4419-4813-7 - Immanuel M. Bomze, Marco Budinich, Panos M. Pardalos, Marcello Pelillo:
The Maximum Clique Problem. 1-74 - Rainer E. Burkard, Eranda Çela:
Linear Assignment Problems and Extensions. 75-149 - Edward G. Coffman Jr., Gábor Galambos, Silvano Martello, Daniele Vigo:
Bin Packing Approximation Algorithms: Combinatorial Analysis. 151-207 - Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende:
Feedback Set Problems. 209-258 - Theodore B. Trafalis, Suat Kasap:
Neural Networks Approaches for Combinatorial Optimization Problems. 259-293 - Robert A. Murphey, Panos M. Pardalos, Mauricio G. C. Resende:
Frequency Assignment Problems. 295-377 - Jun Gu, Paul W. Purdom, John V. Franco, Benjamin W. Wah:
Algorithms for the Satisfiability (SAT) Problem. 379-572 - Jens Albrecht, Dietmar Cieslik:
The Steiner Ratio of L p -planes. 573-589 - Wenqi Huang, Yu-Liang Wu, C. K. Wong:
A Cogitative Algorithm for Solving the Equal Circles Packing Problem. 591-605
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 2024-12-31 21:46 CET 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:
