CENTRAL LIBRARY

Welcome to Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

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

Contributor(s): Gardi, Frédéric.
Material type: materialTypeLabelBookSeries: Focus series in computer engineering: Publisher: London : Hoboken : ISTE Ltd. ; Wiley, ©2014Description: 1 online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9781118966471; 1118966473; 9781118966464; 1118966465; 1306958296; 9781306958295; 9781848216860; 1848216866.Subject(s): Mathematical optimization | MATHEMATICS -- Applied | MATHEMATICS -- Probability & Statistics -- General | Mathematical optimizationGenre/Form: Electronic books.Additional physical formats: Print version:: Mathematical programming solver based on local search.DDC classification: 519.7 Online resources: Wiley Online Library 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.
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 for this item.

Log in to your account to post a comment.

Khulna University of Engineering & Technology

Funded by: HEQEP, UGC, Bangladesh