Price from
61.54 USD

Integer and Combinatorial Optimization: 55

Wiley-Interscience (9780471359432) | Integer and Combinatorial Optimization

 Stores where to buy this product

Sponsored  This site contains affiliate links for which we may receive compensation. More information
This product in Comparor
Category
This product is cataloged in our store in these categories
International
Find this product in one of our international stores
de
231.49 EUR
Colors
Predominant colors of the product
Tags Integer and Combinatorial Optimization
Identifiers
Brand Wiley-Interscience
Wiley-Interscience is a brand of John Wiley & Sons, a publishing company that specializes in scientific, technical, and medical texts and journals.
ID 23120365
Dimensions / Weight
Key Features

Related articles

(9780199655311) - Height: 197mm - Spine width: 16mm - Width: 265mm - Oxford University Press - OUP Oxford - ISBN: 9780199655311 - Number of pages: 288 - Languages: English - Publication date: 25 Jul 2013
Unlock woodworking potential with "Woodworking Basics" by Peter Korn. This essential guide empowers readers to master craftsmanship, offering clear instructions and valuable insights into fundamental techniques.
Boost your network with TP-Link TL-POE160S PoE+ Injector. Wall-mountable, 2 Gigabit ports for high-speed connectivity & easy power over Ethernet setup
Unlock woodworking potential with "Woodworking Basics" by Peter Korn. This essential guide empowers readers to master craftsmanship, offering clear instructions and valuable insights into fundamental techniques.
Boost your network with TP-Link TL-POE160S PoE+ Injector. Wall-mountable, 2 Gigabit ports for high-speed connectivity & easy power over Ethernet setup
🤖 Hello! I'm your virtual assistant. I can help you find products, compare prices and answer questions about your orders. Where should we start?
Chatbot service provided thanks to Gemini 3 / OpenAI using Comparor’s database. The AI may make mistakes — always verify the information.
Comparor AI BETA
Online
Restart the conversation?