Borrow it
Coverart for item
The Resource Disjunctive Programming, by Egon Balas, (electronic resource)

Disjunctive Programming, by Egon Balas, (electronic resource)

Creator
Summary
Disjunctive Programming is a technique and a discipline initiated by the author in the early 1970's, which has become a central tool for solving nonconvex optimization problems like pure or mixed integer programs, through convexification (cutting plane) procedures combined with enumeration. It has played a major role in the revolution in the state of the art of Integer Programming that took place roughly during the period 1990-2010. The main benefit that the reader may acquire from reading this book is a deeper understanding of the theoretical underpinnings and of the applications potential of disjunctive programming, which range from more efficient problem formulation to enhanced modeling capability and improved solution methods for integer and combinatorial optimization. Egon Balas is University Professor and Lord Professor of Operations Research at Carnegie Mellon University's Tepper School of Business.--
Language
eng
Work
Publication
Extent
1 online resource (X, 238 pages)
Contents
  • 1 Disjunctive programming and its relation to integer programming
  • 2 The convex hull of a disjunctive set
  • 3 Sequential convexification of disjunctive sets
  • 4 Moving between conjunctive and disjunctive normal forms
  • 5 Disjunctive programming and extended formulations
  • 6 Lift-and-project cuts for mixed 0-1 programs
  • 7 Nonlinear higher-dimensional representations
  • 8 The correspondence between lift-and-project cuts and simple disjunctive cuts
  • 9 Solving (CGLP)k on the LP simplex tableau
  • 10 Implementation and testing of variants
  • 11 Cuts from general disjunctions
  • 12 Disjunctive cuts from the V -polyhedral representation
  • 13 Unions of polytopes in different spaces
  • References
Isbn
9783030001483
Link
https://eui.idm.oclc.org/login?url=https://doi.org/10.1007/978-3-030-00148-3
Instance
Label
Disjunctive Programming
Title
Disjunctive Programming
Statement of responsibility
by Egon Balas
Creator
Subject
Language
eng
Summary
Disjunctive Programming is a technique and a discipline initiated by the author in the early 1970's, which has become a central tool for solving nonconvex optimization problems like pure or mixed integer programs, through convexification (cutting plane) procedures combined with enumeration. It has played a major role in the revolution in the state of the art of Integer Programming that took place roughly during the period 1990-2010. The main benefit that the reader may acquire from reading this book is a deeper understanding of the theoretical underpinnings and of the applications potential of disjunctive programming, which range from more efficient problem formulation to enhanced modeling capability and improved solution methods for integer and combinatorial optimization. Egon Balas is University Professor and Lord Professor of Operations Research at Carnegie Mellon University's Tepper School of Business.--
Assigning source
Provided by publisher
http://library.link/vocab/creatorName
Balas, Egon
Literary form
non fiction
Nature of contents
dictionaries
Series statement
  • Springer eBooks
  • Springer eBooks.
http://library.link/vocab/subjectName
  • Algorithms
  • Combinatorics
  • Mathematical optimization
  • Mathematics
  • Matrix theory
  • Operations research
Label
Disjunctive Programming, by Egon Balas, (electronic resource)
Link
https://eui.idm.oclc.org/login?url=https://doi.org/10.1007/978-3-030-00148-3
Instantiates
Publication
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
1 Disjunctive programming and its relation to integer programming -- 2 The convex hull of a disjunctive set -- 3 Sequential convexification of disjunctive sets -- 4 Moving between conjunctive and disjunctive normal forms -- 5 Disjunctive programming and extended formulations -- 6 Lift-and-project cuts for mixed 0-1 programs -- 7 Nonlinear higher-dimensional representations -- 8 The correspondence between lift-and-project cuts and simple disjunctive cuts -- 9 Solving (CGLP)k on the LP simplex tableau -- 10 Implementation and testing of variants -- 11 Cuts from general disjunctions -- 12 Disjunctive cuts from the V -polyhedral representation -- 13 Unions of polytopes in different spaces -- References
Control code
978-3-030-00148-3
Dimensions
unknown
Extent
1 online resource (X, 238 pages)
Form of item
  • online
  • electronic
Governing access note
Use of this electronic resource may be governed by a license agreement which restricts use to the European University Institute community. Each user is responsible for limiting use to individual, non-commercial purposes, without systematically downloading, distributing, or retaining substantial portions of information, provided that all copyright and other proprietary notices contained on the materials are retained. The use of software, including scripts, agents, or robots, is generally prohibited and may result in the loss of access to these resources for the entire European University Institute community
Isbn
9783030001483
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
24 illustrations, 6 illustrations in color.
Specific material designation
remote
System control number
(OCoLC)1077497931
Label
Disjunctive Programming, by Egon Balas, (electronic resource)
Link
https://eui.idm.oclc.org/login?url=https://doi.org/10.1007/978-3-030-00148-3
Publication
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
1 Disjunctive programming and its relation to integer programming -- 2 The convex hull of a disjunctive set -- 3 Sequential convexification of disjunctive sets -- 4 Moving between conjunctive and disjunctive normal forms -- 5 Disjunctive programming and extended formulations -- 6 Lift-and-project cuts for mixed 0-1 programs -- 7 Nonlinear higher-dimensional representations -- 8 The correspondence between lift-and-project cuts and simple disjunctive cuts -- 9 Solving (CGLP)k on the LP simplex tableau -- 10 Implementation and testing of variants -- 11 Cuts from general disjunctions -- 12 Disjunctive cuts from the V -polyhedral representation -- 13 Unions of polytopes in different spaces -- References
Control code
978-3-030-00148-3
Dimensions
unknown
Extent
1 online resource (X, 238 pages)
Form of item
  • online
  • electronic
Governing access note
Use of this electronic resource may be governed by a license agreement which restricts use to the European University Institute community. Each user is responsible for limiting use to individual, non-commercial purposes, without systematically downloading, distributing, or retaining substantial portions of information, provided that all copyright and other proprietary notices contained on the materials are retained. The use of software, including scripts, agents, or robots, is generally prohibited and may result in the loss of access to these resources for the entire European University Institute community
Isbn
9783030001483
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
24 illustrations, 6 illustrations in color.
Specific material designation
remote
System control number
(OCoLC)1077497931

Subject

Library Locations

    • Badia FiesolanaBorrow it
      Via dei Roccettini 9, San Domenico di Fiesole, 50014, IT
      43.803074 11.283055

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by European University Institute. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...