• English
    • español
    • français
    • Deutsch
  • English 
    • English
    • español
    • français
    • Deutsch
  • Login
View Item 
  •   TTU DSpace Home
  • ThinkTech
  • Electronic Theses and Dissertations
  • View Item
  •   TTU DSpace Home
  • ThinkTech
  • Electronic Theses and Dissertations
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Valid inequalities and computational results for SOS1-, SOS2-, and cardinality-constrained linear programs

Thumbnail
View/Open
KOZYREFF-DISSERTATION-2014.pdf (603.8Kb)
Date
2014-05
Author
Filho, Ernee K.
Metadata
Show full item record
Abstract
In this dissertation, we consider three types of constraints that are frequently used in mixed integer programming (MIP), namely: SOS1, SOS2, and cardinality. We study and develop cutting planes for those types of constraints, and use them within branch-and-cut to solve difficult MIP instances. Our computational results indicate that the cutting planes used are very effective in reducing the solution times of our instances. We also study the effect of other common features present in commercial solvers, such as preprocessing, "standard" cutting planes, and heuristics.
URI
http://hdl.handle.net/2346/58738
Collections
  • Electronic Theses and Dissertations

DSpace software copyright © 2002-2016  DuraSpace
Contact | Support
TDL
Theme by 
Atmire NV
 

 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDepartmentThis CollectionBy Issue DateAuthorsTitlesSubjectsDepartment

My Account

LoginRegister

DSpace software copyright © 2002-2016  DuraSpace
Contact | Support
TDL
Theme by 
Atmire NV