My Account Log in

1 option

Combinatorial Optimization : Second International Symposium, ISCO 2012, Athens, Greece, 19-21, Revised Selected Papers / edited by A. Ridha Mahjoub, Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos.

SpringerLink Books Computer Science (2011-2024) Available online

SpringerLink Books Computer Science (2011-2024)
Format:
Book
Contributor:
Mahjoub, A. Ridha., Editor.
Markakis, Vangelis., Editor.
Milis, Ioannis., Editor.
Paschos, Vangelis Th., Editor.
SpringerLink (Online service)
Series:
Computer Science (SpringerNature-11645)
LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 7422
Theoretical Computer Science and General Issues, 2512-2029 ; 7422
Language:
English
Subjects (All):
Algorithms.
Computer science-Mathematics.
Discrete mathematics.
Numerical analysis.
Computer networks.
Discrete Mathematics in Computer Science.
Numerical Analysis.
Computer Communication Networks.
Local Subjects:
Algorithms.
Discrete Mathematics in Computer Science.
Numerical Analysis.
Computer Communication Networks.
Physical Description:
1 online resource (XIV, 476 pages) : 63 illustrations
Edition:
1st ed. 2012.
Contained In:
Springer Nature eBook
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
System Details:
text file PDF
Summary:
This book constitutes the thoroughly refereed post-conference proceedings of the Second International Symposium on Combinatorial Optimization, ISCO 2012, held in Athens, Greece, in April 2012. The 37 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 94 regular and 30 short submissions. They present original research on all aspects of combinatorial optimization, ranging from mathematical foundations and theory of algorithms to computational studies and practical applications.
Contents:
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs
Branch-and-Price Guided
The New Faces of Combinatorial Optimization
Models and Algorithms for the Train Unit Assignment Problem
The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation
Using Symmetry to Optimize over the Sherali-Adams Relaxation
A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs
Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program
The Non-Disjoint m-Ring-Star Problem : Polyhedral Results and SDH/SONET Network Design.-The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks
Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem
Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols
An Algebraic Approach to Symmetric Extended Formulations
Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes
Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone.-The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks
Extended Formulations, Nonnegative Factorizations, and Randomized Communication
An Algebraic Approach to Symmetric Extended.-On the Hop Constrained Steiner Tree Problem with Multiple Root.-Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs
A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs.-Extended Formulations, Nonnegative Factorizations, and Randomized Communication
An Algebraic Approach to Symmetric Extended.-Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm.
Other Format:
Printed edition:
ISBN:
978-3-642-32147-4
9783642321474
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account