Integer Programming and Combinatorial Optimization [electronic resource] : 5th International IPCO Conference Vancouver, British Columbia, Canada, June 3–5, 1996 Proceedings /
This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996. The 36 revised papers included in the book were selected from a total of 99 submissions; they highlight recent developments in theory, computation, and applications of integer programming and combinatorial optimization. The volume is organized in sections on integer programming theory and models, network flow algorithms, approximation algorithms, semi-definite methods, matrix models, set systems and submodularity, scheduling, probabilistic methods, polyhedral methods, and the traveling salesman problem.
Main Authors: | , , , |
---|---|
Format: | Texto biblioteca |
Language: | eng |
Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg,
1996
|
Subjects: | Computer science., Software engineering., Computers., Algorithms., Calculus of variations., Probabilities., Combinatorics., Computer Science., Theory of Computation., Probability Theory and Stochastic Processes., Software Engineering/Programming and Operating Systems., Algorithm Analysis and Problem Complexity., Calculus of Variations and Optimal Control; Optimization., |
Online Access: | http://dx.doi.org/10.1007/3-540-61310-2 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996. The 36 revised papers included in the book were selected from a total of 99 submissions; they highlight recent developments in theory, computation, and applications of integer programming and combinatorial optimization. The volume is organized in sections on integer programming theory and models, network flow algorithms, approximation algorithms, semi-definite methods, matrix models, set systems and submodularity, scheduling, probabilistic methods, polyhedral methods, and the traveling salesman problem. |
---|