1
by Dréo, Johann, Pétrowski, Alain, Siarry, Patrick, Taillard, Eric
Published 2006
Springer Berlin Heidelberg
...Metaheuristics for Hard Optimization comprises of three parts. The first part is devoted...

2
Published 2008
Springer Berlin Heidelberg

3
by Bunimovich, L.A., Burago, D., Chernov, N., Cohen, E.G.D.
Published 2000
Springer Berlin Heidelberg
Table of Contents: .... Murphy et al.: On the Sequences of Collisions Among Hard Spheres in Infinite Space; N. Simányi: Hard Ball...

4
by Nisan, Noam
Published 1992
MIT Press
... from hard problems and demonstrates some surprising connections between pseudorandom generators...

5
Published 2023
Springer International Publishing
Table of Contents: ...Predicting the Empirical Hardness of Metric TSP Instances -- A two-phase approach to evaluate...

6
Published 2003
Springer Berlin Heidelberg
Table of Contents: ... Instances by Branch-and-Cut -- The Bundle Method for Hard Combinatorial Optimization Problems -- The One...

7
by Du, Ding-Zhu, Pardalos, Panos M., Hu, Xiaodong, Wu, Weili
Published 2022
Springer International Publishing
Table of Contents: .... Primal-Dual Methods and Minimum Cost Flow -- 8. NP-hard Problems and Approximation Algorithms -- 9...

8
Published 2004
Springer Berlin Heidelberg
Table of Contents: ... of the Graph Colouring Problem -- Hardness Prediction for the University Course Timetabling Problem -- Hybrid...

9
Published 1998
Springer US
Table of Contents: ...4 Hardness Proof for Multi-Level Linear Programs -- 5 The Complexity of Bi-Level Programs -- 6...

10
by Stahl, Reinhold, Staab, Patricia
Published 2018
Springer International Publishing
Table of Contents: ...? -- 3 What Can We Expect From Big Data? -- 4 Why is Data Integration so Hard? -- 5 Basic Thoughts about...

11
by Baptiste, Philippe, Le Pape, Claude, Nuijten, Wim
Published 2001
Springer US
... for the "hardness" of the scheduling problem. Chapters 6, 7, and 8 are dedicated to the resolution of several...

12
by Torquato, Salvatore
Published 2002
Springer New York
Table of Contents: ... Bounds -- 22 Evaluation of Bounds -- 23 Cross-Property Relations -- A Equilibrium Hard-Disk Program -- B...

13
Published 1980
Springer Berlin Heidelberg
Table of Contents: ... salesman problem using a one-arborescence relaxation -- Polynomial bounding for NP-hard problems -- Worst...

14
by Jongen, Hubertus Th, Meer, Klaus, Triesch, Eberhard
Published 2004
Springer US
Table of Contents: ... Machine -- Complexity Theory over the Real Numbers -- Approximating NP-hard Problems -- Approximation...

15
by Molloy, Michael, Reed, Bruce
Published 2002
Springer Berlin Heidelberg
Table of Contents: ... at Talagrand’s Inequality -- 21. Finding Fractional Colourings and Large Stable Sets -- 22. Hard-Core...

16
Published 2012
Springer New York
Table of Contents: ... in Complex Networks (G.J. Baxter, S.N. Dorogovtsev, A.V. Goltsev, J.F.F. Mendes) -- 10. Hardness Complexity...

17
Published 2018
Springer Nature Singapore
Table of Contents: ... projection method and resolvents on Hadamard spaces (Yasunori Kimura) -- Chapter 8. Some Hard Stable Marriage...

18
Published 2016
Springer International Publishing
Table of Contents: ... -- Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem -- On Sampling...

19
Published 2001
Springer Berlin Heidelberg
Table of Contents: ...Two NP-hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines...

20
Published 2010
Springer Netherlands
Table of Contents: ...”: Restructuring Meeting Processes with Instant Messaging -- Soft Computing for Groups Making Hard Decisions...