國立高雄大學圖資館 |

Language: English

Back

Compact extended linear programming ...

Lancia, Giuseppe.

Compact extended linear programming models

Record Type:	Electronic resources : Monograph/item
Title/Author:	Compact extended linear programming modelsby Giuseppe Lancia, Paolo Serafini.
Author:	Lancia, Giuseppe.
other author:	Serafini, Paolo.
Published:	Cham :Springer International Publishing :2018.
Description:	ix, 208 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Business.
Online resource:	http://dx.doi.org/10.1007/978-3-319-63976-5
ISBN:	9783319639765$q(electronic bk.)

Compact extended linear programming models
Lancia, Giuseppe.

Compact extended linear programming models[electronic resource] /by Giuseppe Lancia, Paolo Serafini. - Cham :Springer International Publishing :2018. - ix, 208 p. :ill., digital ;24 cm. - EURO advanced tutorials on operational research,2364-687X. - EURO advanced tutorials on operational research..

Introduction -- Polyhedra -- Linear Programming -- Integer Linear Programming -- Large-scale Linear Programming -- General Techniques for Compact Formulations -- The Permutahedron -- The Parity Polytope -- Trees -- Cuts and Induced Bipartite Subgraphs -- Stable Sets -- Traveling Salesman Problems -- Packing -- Scheduling -- Computational Biology Problems.

This book provides a handy, unified introduction to the theory of compact extended formulations of exponential-size integer linear programming (ILP) models. Compact extended formulations are equally powerful polynomial-sized models whose solutions do not require the implementation of separation and pricing procedures. The book is written in a general, didactic form, first developing the background theoretical concepts (polyhedra, projections, linear and integer programming) and then delving into the various techniques for compact extended reformulations. The techniques are illustrated through a wealth of examples touching on many application areas, such as classical combinatorial optimization, network design, timetabling, scheduling, routing, computational biology and bioinformatics. The book is intended for graduate or PhD students - either as an advanced course on selected topics or within a more general course on ILP and mathematical programming - as well as for practitioners and software engineers in industry exploring techniques for developing optimization models for their specific problems.

ISBN: 9783319639765$q(electronic bk.)

Standard No.: 10.1007/978-3-319-63976-5doiSubjects--Topical Terms:

188101
Business.

LC Class. No.: HD30.23

Dewey Class. No.: 658.40301

Compact extended linear programming models
LDR:02514nmm a2200337 a 4500 001 528077
003 DE-He213
005 20180530160737.0
006 m d
007 cr nn 008maaau
008 181024s2018 gw s 0 eng d
020 $a 9783319639765$q(electronic bk.)
020 $a 9783319639758$q(paper)
024 7 $a 10.1007/978-3-319-63976-5 $2 doi
035 $a 978-3-319-63976-5
040 $a GP $c GP
041 0 $a eng
050 4 $a HD30.23
072 7 $a KJT $2 bicssc
072 7 $a KJMD $2 bicssc
072 7 $a BUS049000 $2 bisacsh
082 0 4 $a 658.40301 $2 23
090 $a HD30.23 $b .L249 2018
100 1 $a Lancia, Giuseppe. $3 800178
245 1 0 $a Compact extended linear programming models $h [electronic resource] / $c by Giuseppe Lancia, Paolo Serafini.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a ix, 208 p. : $b ill., digital ; $c 24 cm.
490 1 $a EURO advanced tutorials on operational research, $x 2364-687X
505 0 $a Introduction -- Polyhedra -- Linear Programming -- Integer Linear Programming -- Large-scale Linear Programming -- General Techniques for Compact Formulations -- The Permutahedron -- The Parity Polytope -- Trees -- Cuts and Induced Bipartite Subgraphs -- Stable Sets -- Traveling Salesman Problems -- Packing -- Scheduling -- Computational Biology Problems.
520 $a This book provides a handy, unified introduction to the theory of compact extended formulations of exponential-size integer linear programming (ILP) models. Compact extended formulations are equally powerful polynomial-sized models whose solutions do not require the implementation of separation and pricing procedures. The book is written in a general, didactic form, first developing the background theoretical concepts (polyhedra, projections, linear and integer programming) and then delving into the various techniques for compact extended reformulations. The techniques are illustrated through a wealth of examples touching on many application areas, such as classical combinatorial optimization, network design, timetabling, scheduling, routing, computational biology and bioinformatics. The book is intended for graduate or PhD students - either as an advanced course on selected topics or within a more general course on ILP and mathematical programming - as well as for practitioners and software engineers in industry exploring techniques for developing optimization models for their specific problems.
650 0 $a Business. $3 188101
650 0 $a Data mining. $3 184440
650 0 $a Mathematical models. $3 182479
650 0 $a Operations research. $3 182516
650 0 $a Management science. $3 200621
650 1 4 $a Business and Management. $2 eflch $3 639169
650 2 4 $a Operations Research/Decision Theory. $3 273963
650 2 4 $a Operations Research, Management Science. $3 511451
650 2 4 $a Mathematical Modeling and Industrial Mathematics. $3 274070
650 2 4 $a Data Mining and Knowledge Discovery. $3 275288
700 1 $a Serafini, Paolo. $3 800179
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a EURO advanced tutorials on operational research. $3 726323
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-63976-5
950 $a Business and Management (Springer-41169)