滿額折
Combinatorial Optimization And Theoretical Computer Science
商品資訊
ISBN13：9781848210219
出版社：John Wiley & Sons Inc
作者：Paschos
出版日：2008/03/04
裝訂／頁數：精裝／544頁
定價
：NT$ 10448 元優惠價
：
90 折 9403 元
若需訂購本書，請電洽客服 02-25006600[分機130、131]。
商品簡介
作者簡介
目次
商品簡介
This volume is dedicated to the theme “Combinatorial Optimization – Theoretical Computer Science: Interfaces and Perspectives” and has two main objectives: the first is to show that bringing together operational research and theoretical computer science can yield useful results for a range of applications, while the second is to demonstrate the quality and range of research conducted by the LAMSADE in these areas.
作者簡介
Vangelis Th. Paschos is a Professor of Computer Science at the University of Paris-Dauphine, France.
目次
Chapter 1. The Complexity of Single Machine Scheduling Problems under Scenario-based Uncertainty (M. A. Aloulou, F. Della Croce).
Chapter 2. (Non)-Approximability Results for the Multi-criteria Min and Max TSP(1, 2) (E. Angel, E. Bampis, L. Gourvès, J. Monnot).
Chapter 3. Online Models for Set-covering: the Flaw of Greediness (G. Ausiello, A. Giannakos, V. Th. Paschos).
Chapter 4. Comparison of Expressiveness for Timed Automata and Time Petri Nets (B. Bérard, F. Cassez, S. Haddad, D. Lime, O. H. Roux).
Chapter 5. A “Maximum Node Clustering” Problem (G. Carello, F. Della Croce, A. Grosso, M. Locatelli).
Chapter 6. The Patrolling Problem: Theoretical and Experimental Results (Y. Chevaleyre).
Chapter 7. Restricted Classes of Utility Functions for Simple Negotiation Schemes: Sufficiency, Necessity and Maximality (Y. Chevaleyre, U. Endriss, N. Maudet).
Chapter 8. Worst-case Complexity of Exact Algorithms for NP-hard Problems (F. Della Croce, B. Escoffier, M. Kaminski, V. Th. Paschos).
Chapter 9. The Online Track Assignment Problem (M. Demange, G. Di Stefano, B. Leroy-Beaulieu).
Chapter 10. Complexity and Approximation Results for the Min Weighted Node Coloring Problem (M. Demange et al).
Chapter 11. Weighted Edge Coloring (M. Demange et al).
Chapter 12. An Extensive Comparison of 0-1 Linear Programs for the Daily Satellite Mission Planning (Virginie Gabrel).
Chapter 13. Dantzig-Wolfe Decomposition for Linearly Constrained Stable Set Problem (Virginie Gabrel).
Chapter 14. Algorithmic Games (Aristotelis Giannakos et al).
Chapter 15. Flows! (Michel Koskas, Cécile Murat).
Chapter 16. The Complexity of the Exact Weighted Independent Set Problem (Martin Milanic, Jérôme Monnot).
Chapter 17. The Labeled Perfect Matching in Bipartite Graphs: Complexity and (in) Approximability (Jérôme Monnot).
Chapter 18. Complexity and Approximation Results for Bounded-size Paths Packing Problems (Jérôme Monnot, Sophie Toulouse).
Chapter 19. An Upper Bound for the Integer Quadratic Multi-knapsack Problem (Dominique Quadri, Eric Soutif, Pierre Tolla).
List of Authors.
Index.
Chapter 2. (Non)-Approximability Results for the Multi-criteria Min and Max TSP(1, 2) (E. Angel, E. Bampis, L. Gourvès, J. Monnot).
Chapter 3. Online Models for Set-covering: the Flaw of Greediness (G. Ausiello, A. Giannakos, V. Th. Paschos).
Chapter 4. Comparison of Expressiveness for Timed Automata and Time Petri Nets (B. Bérard, F. Cassez, S. Haddad, D. Lime, O. H. Roux).
Chapter 5. A “Maximum Node Clustering” Problem (G. Carello, F. Della Croce, A. Grosso, M. Locatelli).
Chapter 6. The Patrolling Problem: Theoretical and Experimental Results (Y. Chevaleyre).
Chapter 7. Restricted Classes of Utility Functions for Simple Negotiation Schemes: Sufficiency, Necessity and Maximality (Y. Chevaleyre, U. Endriss, N. Maudet).
Chapter 8. Worst-case Complexity of Exact Algorithms for NP-hard Problems (F. Della Croce, B. Escoffier, M. Kaminski, V. Th. Paschos).
Chapter 9. The Online Track Assignment Problem (M. Demange, G. Di Stefano, B. Leroy-Beaulieu).
Chapter 10. Complexity and Approximation Results for the Min Weighted Node Coloring Problem (M. Demange et al).
Chapter 11. Weighted Edge Coloring (M. Demange et al).
Chapter 12. An Extensive Comparison of 0-1 Linear Programs for the Daily Satellite Mission Planning (Virginie Gabrel).
Chapter 13. Dantzig-Wolfe Decomposition for Linearly Constrained Stable Set Problem (Virginie Gabrel).
Chapter 14. Algorithmic Games (Aristotelis Giannakos et al).
Chapter 15. Flows! (Michel Koskas, Cécile Murat).
Chapter 16. The Complexity of the Exact Weighted Independent Set Problem (Martin Milanic, Jérôme Monnot).
Chapter 17. The Labeled Perfect Matching in Bipartite Graphs: Complexity and (in) Approximability (Jérôme Monnot).
Chapter 18. Complexity and Approximation Results for Bounded-size Paths Packing Problems (Jérôme Monnot, Sophie Toulouse).
Chapter 19. An Upper Bound for the Integer Quadratic Multi-knapsack Problem (Dominique Quadri, Eric Soutif, Pierre Tolla).
List of Authors.
Index.
購物須知
外文書商品之書封，為出版社提供之樣本。實際出貨商品，以出版社所提供之現有版本為主。部份書籍，因出版社供應狀況特殊，匯率將依實際狀況做調整。
無庫存之商品，在您完成訂單程序之後，將以空運的方式為你下單調貨。為了縮短等待的時間，建議您將外文書與其他商品分開下單，以獲得最快的取貨速度，平均調貨時間為1~2個月。
為了保護您的權益，「三民網路書店」提供會員七日商品鑑賞期(收到商品為起始日)。
若要辦理退貨，請在商品鑑賞期內寄回，且商品必須是全新狀態與完整包裝(商品、附件、發票、隨貨贈品等)否則恕不接受退貨。