Integer Programming and Combinatorial Optimization
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Integer Programming and Combinatorial Optimization: 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, Proceedings
Integer Programming and Combinatorial Optimization: 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, Proceedings

Integer Programming and Combinatorial Optimization: 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, Proceedings

|
     0     
5
4
3
2
1




International Edition


About the Book

Theidea ofa refereedconferencefor the mathematicalprogrammingcommunity was proposed by Ravi Kannan and William Pulleyblank to the Mathematical Programming Society (MPS) in the late 1980s. Thus IPCO was born, and MPS has sponsored the conference as one of its main events since IPCO I at the University of Waterloo in 1990. The conference has become the main forum for recent results in Integer Programming and Combinatorial Optimization in the non-Symposium years. This volume compiles the papers presented at IPCO XIV held June 9-11, 2010, at EPFL in Lausanne. The scope of papers considered for IPCO XIV is likely broader than at IPCO I. This is sometimes due to the wealth of new questions and directions brought from related areas. It can also be due to the successful application of “math programming” techniques to models not tra- tionally considered. In any case, the interest in IPCO is greater than ever and this is re?ected in both the number (135) and quality of the submissions. The ProgrammeCommittee with 13 memberswasalsoIPCO’slargest. We thankthe members of the committee, as well as their sub-reviewers, for their exceptional (and time-consuming) work and especially during the online committee meeting held over January. The process resulted in the selection of 34 excellent research papers which were presented in non-parallel sessions over three days in L- sanne. Unavoidably, this has meant that many excellent submissions were not able to be included.

Table of Contents:
Solving LP Relaxations of Large-Scale Precedence Constrained Problems.- Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings.- Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems.- Restricted b-Matchings in Degree-Bounded Graphs.- Zero-Coefficient Cuts.- Prize-Collecting Steiner Network Problems.- On Lifting Integer Variables in Minimal Inequalities.- Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities.- On Generalizations of Network Design Problems with Degree Bounds.- A Polyhedral Study of the Mixed Integer Cut.- Symmetry Matters for the Sizes of Extended Formulations.- A 3-Approximation for Facility Location with Uniform Capacities.- Secretary Problems via Linear Programming.- Branched Polyhedral Systems.- Hitting Diamonds and Growing Cacti.- Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems.- A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs.- Universal Sequencing on a Single Machine.- Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm.- Integer Quadratic Quasi-polyhedra.- An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs.- An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming.- Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain.- The Price of Collusion in Series-Parallel Networks.- The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron.- A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information.- On Column-Restricted and Priority Covering Integer Programs.- On k-Column Sparse Packing Programs.- Hypergraphic LP Relaxations for Steiner Trees.-Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs.- Efficient Algorithms for Average Completion Time Scheduling.- Experiments with Two Row Tableau Cuts.- An OPT?+?1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths.- On the Rank of Cutting-Plane Proof Systems.


Best Sellers


Product Details
  • ISBN-13: 9783642130359
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Language: English
  • Returnable: Y
  • ISBN-10: 3642130356
  • Publisher Date: 01 Jun 2010
  • Binding: Paperback
  • No of Pages: 466
  • Sub Title: 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Integer Programming and Combinatorial Optimization: 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, Proceedings
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Integer Programming and Combinatorial Optimization: 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, Proceedings
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Integer Programming and Combinatorial Optimization: 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, Proceedings

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!