Welcome to Central Library, SUST
Amazon cover image
Image from Amazon.com
Image from Google Jackets

Mathematical programming solver based on local search / Frédéric Gardi [and others].

Contributor(s): Material type: TextTextSeries: Focus series in computer engineeringPublication details: London : ISTE Ltd. ; Hoboken : Wiley, ©2014.Description: 1 online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9781118966471
  • 1118966473
  • 9781118966464
  • 1118966465
  • 1306958296
  • 9781306958295
  • 9781848216860
  • 1848216866
Subject(s): Genre/Form: Additional physical formats: Print version:: Mathematical programming solver based on local search.DDC classification:
  • 519.7 22
LOC classification:
  • T57.7
Online resources: Summary: This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kin.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Includes bibliographical references and index.

Print version record.

This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kin.

There are no comments on this title.

to post a comment.