Matches in Harvard for { <http://id.lib.harvard.edu/aleph/009109441/catalog> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- catalog contributor b12829047.
- catalog contributor b12829048.
- catalog contributor b12829049.
- catalog created "2003.".
- catalog date "2003".
- catalog date "2003.".
- catalog dateCopyrighted "2003.".
- catalog description ""Eureka, you shrink!": Surprise session for Jack Edmonds -- Submodular functions, matroids, and certain polyhedra -- Matching: A well-solved class of integer linear programs -- Theoretical improvements in algorithmic efficiency for network flow problems -- Connected matchings -- Hajós' construction and polytopes -- Algorithmic characterization of bipartite ♭-matching and matroid intersection -- Solving real-world ATSP instances by branch-and-cut -- The bundle method for hard combinatorial optimization problems -- The one-commodity pickup-and-delivery travelling salesman problem -- Reconstructing a simple polytope from its graph -- An augment-and-branch-and-cut framework for mixed 0-1 programming -- A procedure of facet composition for the symmetric traveling salesman polytope -- Constructing new facets of the consecutive ones polytope -- A simplex-based algorithm for 0-1 mixed integer programming -- Mixed-integer value functions in stochastic programming -- Exact algorithms for NP-hard problems: A survey -- Author index.".
- catalog description "Includes bibliographical references and index.".
- catalog extent "x, 207 p. :".
- catalog identifier "3540005803 (softcover : alk. paper)".
- catalog isPartOf "Lecture notes in computer science, 0302-9743 ; 2570".
- catalog issued "2003".
- catalog issued "2003.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "519.3 21".
- catalog subject "Combinatorial optimization Congresses.".
- catalog subject "QA402.5 .C54515 2003".
- catalog tableOfContents ""Eureka, you shrink!": Surprise session for Jack Edmonds -- Submodular functions, matroids, and certain polyhedra -- Matching: A well-solved class of integer linear programs -- Theoretical improvements in algorithmic efficiency for network flow problems -- Connected matchings -- Hajós' construction and polytopes -- Algorithmic characterization of bipartite ♭-matching and matroid intersection -- Solving real-world ATSP instances by branch-and-cut -- The bundle method for hard combinatorial optimization problems -- The one-commodity pickup-and-delivery travelling salesman problem -- Reconstructing a simple polytope from its graph -- An augment-and-branch-and-cut framework for mixed 0-1 programming -- A procedure of facet composition for the symmetric traveling salesman polytope -- Constructing new facets of the consecutive ones polytope -- A simplex-based algorithm for 0-1 mixed integer programming -- Mixed-integer value functions in stochastic programming -- Exact algorithms for NP-hard problems: A survey -- Author index.".
- catalog title "Combinatorial optimization--Eureka, you shrink! : papers dedicated to Jack Edmonds : 5th international workshop, Aussois, France, March 5-9, 2001, revised papers / Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi (eds.).".
- catalog type "Conference proceedings. fast".
- catalog type "text".