Biobjective Combinatorial Optimization Tsp by Stevanato Elisa (4 results)
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 58.86
£ 60.15 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Biobjective combinatorial optimization and the TSP with profits | Methods and algorithms | Elisa Stevanato (u. a.) | Taschenbuch | Englisch | LAP Lambert Academic Publishing | EAN 9783659221989 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[a…t]preigu[dot]de | Anbieter: preigu.
- Softcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
£ 146.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 57.02
£ 42.09 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Stevanato ElisaStudied Pure and Applied Mathematics at Padua University, obtained the PhD in Mathematics and Computer Science at Ferrara University. Currently,is working in the…Department of Economics and Management of the University.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 70.76
£ 52.97 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Bi-objective combinatorial optimization (BOCO) deals with mathematical programming models where two competing objectives have to be minimised subject to constraints. A number of real world applications may be cast in this setting, where…the objective and constraint functions are linear and the variables are binary. In a BOCO problem usually there is no solution that simultaneously minimise both objectives, so it is necessary to describe a set of Pareto optimal solutions, or solutions such that it is not possible to improve one objective without worsening the other. In this work we review the exact, heuristic and approximated methods developed to date for the construction of the Pareto optimal set in BOCO problems. Emphasis is given to exact and to approximate methods where a subset of the exact set of Pareto optimal solutions is given. We apply all the analysed methods to a hard BOCO problem: the Traveling Salesman Problem with Profits (TSPP). Specific approaches for the TSPP on graphs with special metrics and/or with time windows are also discussed. Finally, the approaches studied are suggested as a methodology to face a case study connecting Medicine and Computer Science.
