Last edited by Gojar
Saturday, August 1, 2020 | History

1 edition of Knapsack cuts and explicit-constraint branching for solving integer programs found in the catalog.

Knapsack cuts and explicit-constraint branching for solving integer programs

by Jeffrey A. Appleget

  • 117 Want to read
  • 37 Currently reading

Published by Naval Postgraduate School, Available from National Technical Information Service in Monterey, Calif, Springfield, Va .
Written in English

    Subjects:
  • OPTIMIZATION,
  • INTEGER PROGRAMMING

  • About the Edition

    Enhanced solution techniques are developed for solving integer programs (IPs) and mixed-integer programs (MIPs). Previously unsolvable problems can be solved with these new techniques. We develop knapsack cut-finding procedures for minimal cover cuts, and convert existing cut-strengthening theory into practical procedures that lift and tighten violated minimal cover valid inequalities to violated knapsack facets in polynomial time. We find a new class of knapsack cuts called "non-minimal cover cuts" and a method of lifting them called "deficit lifting." Deficit lifting enables all of these cuts to be lifted and tightened to facets as well. Extensions of these techniques enable us to find cuts for elastic knapsack constraints and cuts for non-standard knapsack constraints. We also develop the new technique of "explicit-constraint branching" (ECB). ECB enables the technique of constraint branching to be used on IPs and MIPs that do not have the structure required for known "implicit constraint branching" techniques. When these techniques are applied to 84 randomly generated generalized assignment problems, the combination of knapsack cuts and explicit-constraint branching were able to solve 100% of the problems in under 1000 CPU seconds. Explicit constraint branching alone solved 94%, and knapsack cuts solved 93%. Standard branch and bound alone solved only 38%. The benefits of these techniques are also demonstrated on some real-world generalized assignment and set-partitioning problems.

    The Physical Object
    Paginationxvi, 129 p. ;
    Number of Pages129
    ID Numbers
    Open LibraryOL25312330M


Share this book
You might also like
dynamics of urban spatial structure in China, 1949-76

dynamics of urban spatial structure in China, 1949-76

Spare me, O Lucifer!

Spare me, O Lucifer!

Pattern recognition and image analysis

Pattern recognition and image analysis

Gmelin Handbook of Inorganic and Organometallic Chemistry - 8th Edition Element C-U Cu. Kupfer. Copper (System-NR. 60) Ergdnzungsband 1-4 Cu-Organisch

Gmelin Handbook of Inorganic and Organometallic Chemistry - 8th Edition Element C-U Cu. Kupfer. Copper (System-NR. 60) Ergdnzungsband 1-4 Cu-Organisch

The ballet class

The ballet class

Exploring artificial intelligence on your BBC micro

Exploring artificial intelligence on your BBC micro

Reining Woods

Reining Woods

Liberation struggle in Portuguese colonies.

Liberation struggle in Portuguese colonies.

Principles in design

Principles in design

Campbells Alphabet Soup Book (A Turn & Learn Board Book)

Campbells Alphabet Soup Book (A Turn & Learn Board Book)

Language, culture and personality

Language, culture and personality

The yearly chronicle for M,DCC,LXI

The yearly chronicle for M,DCC,LXI

Edouard Manet

Edouard Manet

52 ways to live a long and healthy life

52 ways to live a long and healthy life

A Japanese boyhood.

A Japanese boyhood.

The Big Nowhere

The Big Nowhere

Knapsack cuts and explicit-constraint branching for solving integer programs by Jeffrey A. Appleget Download PDF EPUB FB2

Knapsack cuts and explicit-constraint branching for solving integer programs [Jeffrey A. Appleget] on simplicityhsd.com *FREE* shipping on qualifying simplicityhsd.com: Jeffrey A. Appleget. This paper develops a new generalized-branching technique called “explicit-constraint branching” to improve the performance of branch-and-bound algorithms for solving mixed-integer programs () “Knapsack cuts and explicit-constraint branching for solving integer programs”, Ph.D.

dissertation, Naval Postgraduate School Cited by: In this paper, we describe an exact algorithm for solving a multi-objective integer indefinite quadratic fractional maximization problem.

The algorithm generates the whole set of efficient. When these techniques are applied to 84 randomly generated generalized assignment problems, the combination of knapsack cuts and explicit-constraint branching were able to solve % of the.

Early Integer Programming Knapsack Cuts and Explicit-Constraint Branching for Solving Integer Programs. the combination of knapsack cuts and explicit-constraint branching were able to Author: Ralph Gomory.

On generalized branching methods for mixed integer programming Based on these results algorithms are also given for solving mixed convex integer programs. can be ensured by introducing an. Kevin Wood's research while affiliated with Naval Postgraduate School and other places. Explicit-Constraint Branching for Solving Mixed Integer Programs.

Article. Full-text available. Cs Design and Analysis of Algorithms Appasami Lecture Notes - Free ebook download as PDF File .pdf), Text File .txt) or read book online for free. CS DESIGN AND ANALYSIS OF ALGORITHMS Appasami Lecture notes Anna university II year IV semester Computer Science and engineering/5(6).

The IPCO series of conferences presents recent results in theory, computation and applications of integer programming and combinatorial optimization. These conferences are sponsored by the Mathematical Programming Society, and are held in those years in which no International Symposium on Mathematical Programming takes place.

Integer Programming and Combinatorial Optimization, 13 conf., IPCO the 13th International Conference on Integer Programming and Combinatorial Optimization that was held in Bertinoro (Italy), May 26–28, [13] introduce the class of perspective cuts for mixed integer programs of the form minn f (x) + cz | Ax ≤ bz, (x,z)∈R ×B.

Introduction to Stochastic Programming is intended as a first course for beginning graduate students or advanced undergraduate students in such fields as operations research, industrial engineering, business administration (in particular, finance or management science), and mathematics.

In particular, we included here some perennial puzzles, since, as it has been recognised for some time, they form an excellent vehicle to explain certain principles of constraint programming.

As already mentioned in Chapter 1 the representation of a problem as a CSP is usually called modeling. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems Second International Conference, CPAIOR Prague, Czech.

Full text of "Advances in artificial intelligence: 14th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, AIOttawa, Canada, June. Optimization in Engineering Models and Algorithms - Free ebook download as PDF File .pdf), Text File .txt) or read book online for free.

Libro de análisis de optimización en ingeniería química, describe modelos y algoritmos necesarios para resolver problemas de optimización en procesos químicos.

Fundamentos de Circuitos Elc3a9ctricos 3edi Sadiku - Free ebook download as PDF File .pdf), Text File .txt) or read book online for free. Ebook description of power system 9th edition.