國立虎尾科技大學 |

Compact Extended Linear Programming Models

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Compact Extended Linear Programming Models/ by Giuseppe Lancia, Paolo Serafini.
作者:	Lancia, Giuseppe.
其他作者:	Serafini, Paolo.
面頁冊數:	IX, 208 p. 37 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Operations research. -
電子資源:	https://doi.org/10.1007/978-3-319-63976-5
ISBN:	9783319639765

Compact Extended Linear Programming Models
Lancia, Giuseppe.

Compact Extended Linear Programming Models[electronic resource] /by Giuseppe Lancia, Paolo Serafini. - 1st ed. 2018. - IX, 208 p. 37 illus.online resource. - 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

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

573517
Operations research.

LC Class. No.: HD30.23

Dewey Class. No.: 658.40301

Compact Extended Linear Programming Models
LDR:02919nam a22004215i 4500 001 999131
003 DE-He213
005 20200705201312.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783319639765 $9 978-3-319-63976-5
024 7 $a 10.1007/978-3-319-63976-5 $2 doi
035 $a 978-3-319-63976-5
050 4 $a HD30.23
072 7 $a KJT $2 bicssc
072 7 $a BUS049000 $2 bisacsh
072 7 $a KJT $2 thema
072 7 $a KJMD $2 thema
082 0 4 $a 658.40301 $2 23
100 1 $a Lancia, Giuseppe. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1290706
245 1 0 $a Compact Extended Linear Programming Models $h [electronic resource] / $c by Giuseppe Lancia, Paolo Serafini.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a IX, 208 p. 37 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
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 Operations research. $3 573517
650 0 $a Decision making. $3 528319
650 0 $a Management science. $3 719678
650 0 $a Mathematical models. $3 527886
650 0 $a Data mining. $3 528622
650 1 4 $a Operations Research/Decision Theory. $3 669176
650 2 4 $a Operations Research, Management Science. $3 785065
650 2 4 $a Mathematical Modeling and Industrial Mathematics. $3 669172
650 2 4 $a Data Mining and Knowledge Discovery. $3 677765
700 1 $a Serafini, Paolo. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1290707
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319639758
776 0 8 $i Printed edition: $z 9783319639772
776 0 8 $i Printed edition: $z 9783319876870
830 0 $a EURO Advanced Tutorials on Operational Research, $x 2364-687X $3 1254373
856 4 0 $u https://doi.org/10.1007/978-3-319-63976-5
912 $a ZDB-2-BUM
912 $a ZDB-2-SXBM
950 $a Business and Management (SpringerNature-41169)
950 $a Business and Management (R0) (SpringerNature-43719)