English
Combinatorial Optimization — Eureka, You Shrink!
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 “Eureka — You Shrink!”
-
Altmetric BadgeChapter 2 Submodular Functions, Matroids, and Certain Polyhedra
-
Altmetric BadgeChapter 3 Matching: A Well-Solved Class of Integer Linear Programs
-
Altmetric BadgeChapter 4 Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
-
Altmetric BadgeChapter 5 Connected Matchings
-
Altmetric BadgeChapter 6 Hajós’ Construction and Polytopes
-
Altmetric BadgeChapter 7 Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection
-
Altmetric BadgeChapter 8 Solving Real-World ATSP Instances by Branch-and-Cut
-
Altmetric BadgeChapter 9 The Bundle Method for Hard Combinatorial Optimization Problems
-
Altmetric BadgeChapter 10 The One-Commodity Pickup-and-Delivery Travelling Salesman Problem
-
Altmetric BadgeChapter 11 Reconstructing a Simple Polytope from Its Graph
-
Altmetric BadgeChapter 12 An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming
-
Altmetric BadgeChapter 13 A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope
-
Altmetric BadgeChapter 14 Constructing New Facets of the Consecutive Ones Polytope
-
Altmetric BadgeChapter 15 A Simplex-Based Algorithm for 0-1 Mixed Integer Programming
-
Altmetric BadgeChapter 16 Mixed-Integer Value Functions in Stochastic Programming
-
Altmetric BadgeChapter 17 Exact Algorithms for NP-Hard Problems: A Survey
Altmetric Badge
Readers on
- mendeley
- 31 Mendeley