Cutting plane algorithms for 0-1 programming based on cardinality cuts

Simple item page
dc.citation.epage279en_US
dc.citation.issueNumber2en_US
dc.citation.spage273en_US
dc.citation.volumeNumber205en_US
dc.contributor.authorOguz, O.en_US
dc.date.accessioned2016-02-08T09:57:09Z
dc.date.available2016-02-08T09:57:09Z
dc.date.issued2010en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractWe present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by their revision and use in integer programming as a new generation of cuts that excludes not only portions of polyhedra containing noninteger points, also parts with some integer points that have been explored in search of an optimal solution. Our computational experimentations demonstrate that this new approach has significant potential for solving large scale integer programming problems.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T09:57:09Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2010en
dc.identifier.doi10.1016/j.ejor.2010.01.006en_US
dc.identifier.eissn1872-6860
dc.identifier.issn0377-2217
dc.identifier.urihttp://hdl.handle.net/11693/22224
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.ejor.2010.01.006en_US
dc.source.titleEuropean Journal of Operational Researchen_US
dc.subject0-1 Integer programmingen_US
dc.subjectCutting planesen_US
dc.titleCutting plane algorithms for 0-1 programming based on cardinality cutsen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Cutting_plane_algorithms_for_0-1_programming_based_on_cardinality_cuts.pdf
Size:
204.64 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering