logo
logo
x
바코드검색
BOOKPRICE.co.kr
책, 도서 가격비교 사이트
바코드검색

인기 검색어

실시간 검색어

검색가능 서점

도서목록 제공

Combinatorial Optimization and Theoretical Computer Science : Interfaces and Perspectives

Combinatorial Optimization and Theoretical Computer Science : Interfaces and Perspectives (Hardcover)

Vangelis Th Paschos (지은이)
  |  
Iste/Hermes Science Pub
2008-03-10
  |  
279,000원

일반도서

검색중
서점 할인가 할인률 배송비 혜택/추가 실질최저가 구매하기
알라딘 251,100원 -10% 0원 12,560원 238,540원 >
yes24 로딩중
교보문고 로딩중
notice_icon 검색 결과 내에 다른 책이 포함되어 있을 수 있습니다.

중고도서

검색중
로딩중

e-Book

검색중
서점 정가 할인가 마일리지 실질최저가 구매하기
로딩중

해외직구

책 이미지

Combinatorial Optimization and Theoretical Computer Science : Interfaces and Perspectives

책 정보

· 제목 : Combinatorial Optimization and Theoretical Computer Science : Interfaces and Perspectives (Hardcover) 
· 분류 : 외국도서 > 컴퓨터 > 컴퓨터 공학
· ISBN : 9781848210219
· 쪽수 : 544쪽

목차

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.

이 포스팅은 쿠팡 파트너스 활동의 일환으로,
이에 따른 일정액의 수수료를 제공받습니다.
도서 DB 제공 : 알라딘 서점(www.aladin.co.kr)
최근 본 책