Methods for combinatorial optimization -With examples

Omar Selt

ISBN 10: 6200046379 / ISBN 13: 9786200046376

Published by Omniscriptum, Noor Publishing, 2025

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -A combinatorial optimization problem consists of finding the minimum s of a function f (economic functions), with real or integer variable on a finite set S, the elements of S verifying certain Optimization is choosing an efficient method capable of producing an optimal solution in a reasonablecomputational time. The different resolution methods developed can be classified into two categories: exact methods which guarantee the completeness of the resolution and approximate methods which lose completeness to gain efficiency. constraints are called feasible solutions; among which, the optimal solution is included. 52 pp. Englisch.

Seller Inventory # 9786200046376

Bibliographic Details

• Title: Methods for combinatorial optimization -With examples
• Publisher: Omniscriptum, Noor Publishing
• Publication Date: 2025
• Language: English
• ISBN 10: 6200046379
• ISBN 13: 9786200046376
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 33D millimeters 220 millimeters width by 150 millimeters height by 33 millimeters depth

About this title

Synopsis

A combinatorial optimization problem consists of finding the minimum s of a function f (economic functions), with real or integer variable on a finite set S, the elements of S verifying certain Optimization is choosing an efficient method capable of producing an optimal solution in a reasonablecomputational time. The different resolution methods developed can be classified into two categories: exact methods which guarantee the completeness of the resolution and approximate methods which lose completeness to gain efficiency. constraints are called feasible solutions; among which, the optimal solution is included..