Combinatorial Optimization and Theoretical Computer Science
Regular price
€262.82
14 days return policy
Shipping & Delivery
Category=UY
combinatorial optimization theoretical
complexity
computer science
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
interfaces
lamsade
machine
main
max
min
multicriteria
objectives
problems
quality
range
research
scenariobased
second
single
theme
two
uncertainty
volume
Product details
- ISBN 9781848210219
- Weight: 885g
- Dimensions: 158 x 236mm
- Publication Date: 10 Mar 2008
- Publisher: ISTE Ltd and John Wiley & Sons Inc
- Publication City/Country: GB
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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.
