"Combinatorial Optimization and Applications" - Information and Links:

Combinatorial Optimization and Applications - Info and Reading Options

8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings

"Combinatorial Optimization and Applications" was published by Springer London, Limited in 2014 - Cham, it has 774 pages and the language of the book is English.


“Combinatorial Optimization and Applications” Metadata:

  • Title: ➤  Combinatorial Optimization and Applications
  • Authors:
  • Language: English
  • Number of Pages: 774
  • Publisher: Springer London, Limited
  • Publish Date:
  • Publish Location: Cham

“Combinatorial Optimization and Applications” Subjects and Themes:

Edition Identifiers:

AI-generated Review of “Combinatorial Optimization and Applications”:


"Combinatorial Optimization and Applications" Description:

Open Data:

Intro -- Preface -- Organization -- Contents -- Classic Combinatorial Optimization -- An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling -- 1 Introduction -- 2 Related Work -- 3 Problem Formulation -- 3.1 Computational Complexity -- 4 Algorithms -- 4.1 PDM-Exact: An Optimal FPT Algorithm -- 4.2 PDM-Heuristic: A Simple Heuristic Algorithm -- 5 Experimental Results -- 6 Conclusions -- References -- An Asymptotic Competitive Scheme for Online Bin Packing -- 1 Introduction -- 2 Preliminaries -- 3 Bounded Instances -- 4 From Modified Instances to General Instances -- 5 From Bounded Instances to Modified Instances -- 5.1 Overview of the Technique -- 5.2 Constructing an Algorithm for Modified Instances -- 6 Concluding Remarks -- References -- Randomized Online Algorithms for Set Cover Leasing Problems -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contribution -- 1.3 Organization of the Paper -- 2 Preliminaries -- 3 A Randomized Algorithm -- 4 Analysis -- 4.1 Online Set Multicover -- 4.2 Online Set Multicover with Repetitions -- 4.3 Set Multicover Leasing -- 5 Conclusion -- References -- Geometric Optimization -- Optimizing Squares Covering a Set of Points -- 1 Introduction -- 2 Minimizing the Enclosing Square Size -- 2.1 One Square, Arbitrary Orientation -- 2.2 One Square, Arbitrary Orientation, Rectangular Obstacle -- 2.3 Two Disjoint Axis-Parallel Squares -- 2.4 Two Overlapping Axis-Parallel Squares -- 2.5 Two Disjoint Squares, One Axis-Parallel, the Other of Arbitrary Orientation -- 2.6 Two Squares, One Axis-Parallel, the Other of Arbitrary Orientation, ``don't care'' -- 2.7 Two Squares, Each of Arbitrary Orientation, ``don't care'' -- 2.8 Three Disjoint Axis-Parallel Squares -- 2.9 Guillotine k-partition -- 2.10 Four Disjoint Axis-Parallel Squares -- 3 Maximizing the Number of Enclosed Points by Unit Squares

Read “Combinatorial Optimization and Applications”:

Read “Combinatorial Optimization and Applications” by choosing from the options below.

Search for “Combinatorial Optimization and Applications” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Combinatorial Optimization and Applications” in Libraries Near You:

Read or borrow “Combinatorial Optimization and Applications” from your local library.

Buy “Combinatorial Optimization and Applications” online:

Shop for “Combinatorial Optimization and Applications” on popular online marketplaces.