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

We 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 conta...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research Jg. 205; H. 2; S. 273 - 279
1. Verfasser: Oguz, Osman
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.09.2010
Elsevier
Elsevier Sequoia S.A
Schriftenreihe:European Journal of Operational Research
Schlagworte:
0-1 Integer programming
0-1 Integer programming Valid inequalities Cutting planes
Applied sciences
Cutting planes
Cutting stock problem
Exact sciences and technology
Integer programming
Mathematical programming
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Studies
Valid inequalities
Cutting planes
0-1 Integer programming
Valid inequalities
Polyhedron
Integer programming
Zero one programming
Cutting plane method
Cut generation
Large scale system
ISSN:0377-2217, 1872-6860
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We 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.
AbstractList We 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. [PUBLICATION ABSTRACT]
We 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.
Author Oguz, Osman
Author_xml – sequence: 1
  givenname: Osman
  surname: Oguz
  fullname: Oguz, Osman
  email: ooguz@bilkent.edu.tr
  organization: Department of Industrial Engineering, Bilkent University, Ankara, Turkey
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22524874$$DView record in Pascal Francis
http://econpapers.repec.org/article/eeeejores/v_3a205_3ay_3a2010_3ai_3a2_3ap_3a273-279.htm$$DView record in RePEc
BookMark eNp9Uc-L1DAUDrKCs6v_gKcieOz4kqZNA15kcFVc8KLnkKYvsyltUpPMwvz3pjurBw8bSL5H-H483rsmVz54JOQthT0F2n2Y9jiFuGdQPoDuAboXZEd7wequ7-CK7KARomaMilfkOqUJAGhL2x25PZxydv5YrbP2WOn5GKLL90uqbIgV1LRaYzhGvSwbadAJxyr4yug4Oq9nl8-VOeX0mry0ek745glvyK_bzz8PX-u7H1--HT7d1YazNtdmGGw3yo5J5ExoLcXAYTBGWrDcDpxxjqJFKXVLkfeNsB1KlH0vx2YQvWxuyLuLb-nq9wlTVlM4xdJIUgw4laLlUEjfL6SIKxq1RrfoeFZYThkSJvWgGs2gLe_5saJQwG1lueuGolFMSHWfl-L2_ilSJ6NnG7U3Lv1zZaxlvBe88PoLz8SQUkSrjMs6u-Bz1G5WJWRblZrU1oV6TAWqyqqKlP0n_ev-rOjjRYRl3g8Oo0rGoTc4uogmqzG45-R_AMyhrcM
CODEN EJORDT
CitedBy_id crossref_primary_10_1080_0305215X_2013_836637
Cites_doi 10.1090/S0002-9904-1958-10224-4
10.1287/ijoc.11.1.117
10.1287/ijoc.12.1.2.11900
10.1057/jors.1990.166
10.1287/ijoc.11.2.205
10.1287/opre.31.5.803
ContentType Journal Article
Copyright 2010 Elsevier B.V.
2015 INIST-CNRS
Copyright Elsevier Sequoia S.A. Sep 1, 2010
Copyright_xml – notice: 2010 Elsevier B.V.
– notice: 2015 INIST-CNRS
– notice: Copyright Elsevier Sequoia S.A. Sep 1, 2010
DBID AAYXX
CITATION
IQODW
DKI
X2L
7SC
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
DOI 10.1016/j.ejor.2010.01.006
DatabaseName CrossRef
Pascal-Francis
RePEc IDEAS
RePEc
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
Applied Sciences
EISSN 1872-6860
EndPage 279
ExternalDocumentID 1973809061
eeeejores_v_3a205_3ay_3a2010_3ai_3a2_3ap_3a273_279_htm
22524874
10_1016_j_ejor_2010_01_006
S0377221710000147
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1OL
1RT
1~.
1~5
29G
4.4
41~
457
4G.
5GY
5VS
6OB
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
AAYFN
AAYOK
ABAOU
ABBOA
ABFNM
ABFRF
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACIWK
ACNCT
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
ADIYS
ADJOM
ADMUD
AEBSH
AEFWE
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
RXW
SCC
SDF
SDG
SDP
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SSV
SSW
SSZ
T5K
TAE
TN5
U5U
VH1
WUQ
XPP
ZMT
~02
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADXHL
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
02
08R
0R
1
41
6XO
8P
AAPBV
ABFLS
ADALY
DKI
G-
HZ
IPNFZ
K
M
MS
PQEST
STF
X
X2L
7SC
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c425t-cbbf6d9629e427aa97b40bcc9f0f4fb4244e75e99a51e4837f6e9e9889d3b7893
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000276030200005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0377-2217
IngestDate Sun Nov 09 07:11:22 EST 2025
Wed Aug 18 03:50:56 EDT 2021
Mon Jul 21 09:14:28 EDT 2025
Sat Nov 29 01:40:59 EST 2025
Tue Nov 18 22:02:57 EST 2025
Fri Feb 23 02:32:26 EST 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Cutting planes
0-1 Integer programming
Valid inequalities
Polyhedron
Integer programming
Zero one programming
Cutting plane method
Cut generation
Large scale system
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c425t-cbbf6d9629e427aa97b40bcc9f0f4fb4244e75e99a51e4837f6e9e9889d3b7893
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 204197540
PQPubID 45678
PageCount 7
ParticipantIDs proquest_journals_204197540
repec_primary_eeeejores_v_3a205_3ay_3a2010_3ai_3a2_3ap_3a273_279_htm
pascalfrancis_primary_22524874
crossref_citationtrail_10_1016_j_ejor_2010_01_006
crossref_primary_10_1016_j_ejor_2010_01_006
elsevier_sciencedirect_doi_10_1016_j_ejor_2010_01_006
PublicationCentury 2000
PublicationDate 2010-09-01
PublicationDateYYYYMMDD 2010-09-01
PublicationDate_xml – month: 09
  year: 2010
  text: 2010-09-01
  day: 01
PublicationDecade 2010
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationSeriesTitle European Journal of Operational Research
PublicationTitle European journal of operational research
PublicationYear 2010
Publisher Elsevier B.V
Elsevier
Elsevier Sequoia S.A
Publisher_xml – name: Elsevier B.V
– name: Elsevier
– name: Elsevier Sequoia S.A
References OR-Library. Available at
Ferreira, Martin, Weismantel (bib3) 1996
Cornuejols, Dawande (bib1) 1999; 11
Gomory (bib4) 1958; 64
Nemhauser, Wolsey (bib7) 1988
Wolsey (bib10) 1998
Crowder, Johnson, Padberg (bib2) 1983; 31
Johnson, Nemhauser, Savelsbergh (bib6) 2000; 12
Beasley (bib9) 1990; 41
Gu, Nemhauser, Savelsbergh (bib5) 1999; 11
.
Nemhauser (10.1016/j.ejor.2010.01.006_bib7) 1988
10.1016/j.ejor.2010.01.006_bib8
Cornuejols (10.1016/j.ejor.2010.01.006_bib1) 1999; 11
Crowder (10.1016/j.ejor.2010.01.006_bib2) 1983; 31
Gomory (10.1016/j.ejor.2010.01.006_bib4) 1958; 64
Wolsey (10.1016/j.ejor.2010.01.006_bib10) 1998
Ferreira (10.1016/j.ejor.2010.01.006_bib3) 1996
Beasley (10.1016/j.ejor.2010.01.006_bib9) 1990; 41
Johnson (10.1016/j.ejor.2010.01.006_bib6) 2000; 12
Gu (10.1016/j.ejor.2010.01.006_bib5) 1999; 11
References_xml – volume: 64
  start-page: 275
  year: 1958
  end-page: 278
  ident: bib4
  article-title: Outline of an algorithm for integer solutions to linear programs
  publication-title: Bulletin of the American Mathematical Society
– volume: 11
  start-page: 205
  year: 1999
  end-page: 210
  ident: bib1
  article-title: A class of hard small 0-1 programs
  publication-title: INFORMS Journal on Computing
– start-page: 6858
  year: 1996
  end-page: 6877
  ident: bib3
  article-title: Solving multiple knapsack problems by cutting planes
  publication-title: SIAM Journal of Optimization
– reference: OR-Library. Available at (
– volume: 11
  start-page: 117
  year: 1999
  end-page: 123
  ident: bib5
  article-title: Lifted cover inequalities for 0-1 integer programs: complexity
  publication-title: INFORMS Journal on Computing
– volume: 31
  start-page: 803
  year: 1983
  end-page: 834
  ident: bib2
  article-title: Solving large scale 0-1 linear programming problems
  publication-title: Operational Research
– volume: 12
  start-page: 2
  year: 2000
  end-page: 23
  ident: bib6
  article-title: Progress in linear programming-based algorithms for integer programming: an exposition
  publication-title: INFORMS Journal on Computing
– year: 1988
  ident: bib7
  article-title: Integer and Combinatorial Optimization
– reference: ).
– volume: 41
  start-page: 1069
  year: 1990
  end-page: 1072
  ident: bib9
  article-title: OR-Library: distributing test problems by electronic mail
  publication-title: Journal of the Operational Research Society
– year: 1998
  ident: bib10
  article-title: Integer Programming
– volume: 64
  start-page: 275
  year: 1958
  ident: 10.1016/j.ejor.2010.01.006_bib4
  article-title: Outline of an algorithm for integer solutions to linear programs
  publication-title: Bulletin of the American Mathematical Society
  doi: 10.1090/S0002-9904-1958-10224-4
– volume: 11
  start-page: 117
  year: 1999
  ident: 10.1016/j.ejor.2010.01.006_bib5
  article-title: Lifted cover inequalities for 0-1 integer programs: complexity
  publication-title: INFORMS Journal on Computing
  doi: 10.1287/ijoc.11.1.117
– volume: 12
  start-page: 2
  year: 2000
  ident: 10.1016/j.ejor.2010.01.006_bib6
  article-title: Progress in linear programming-based algorithms for integer programming: an exposition
  publication-title: INFORMS Journal on Computing
  doi: 10.1287/ijoc.12.1.2.11900
– volume: 41
  start-page: 1069
  issue: 11
  year: 1990
  ident: 10.1016/j.ejor.2010.01.006_bib9
  article-title: OR-Library: distributing test problems by electronic mail
  publication-title: Journal of the Operational Research Society
  doi: 10.1057/jors.1990.166
– year: 1998
  ident: 10.1016/j.ejor.2010.01.006_bib10
– start-page: 6858
  year: 1996
  ident: 10.1016/j.ejor.2010.01.006_bib3
  article-title: Solving multiple knapsack problems by cutting planes
  publication-title: SIAM Journal of Optimization
– ident: 10.1016/j.ejor.2010.01.006_bib8
– year: 1988
  ident: 10.1016/j.ejor.2010.01.006_bib7
– volume: 11
  start-page: 205
  year: 1999
  ident: 10.1016/j.ejor.2010.01.006_bib1
  article-title: A class of hard small 0-1 programs
  publication-title: INFORMS Journal on Computing
  doi: 10.1287/ijoc.11.2.205
– volume: 31
  start-page: 803
  year: 1983
  ident: 10.1016/j.ejor.2010.01.006_bib2
  article-title: Solving large scale 0-1 linear programming problems
  publication-title: Operational Research
  doi: 10.1287/opre.31.5.803
SSID ssj0001515
Score 1.9655906
Snippet We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these...
SourceID proquest
repec
pascalfrancis
crossref
elsevier
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 273
SubjectTerms 0-1 Integer programming
0-1 Integer programming Valid inequalities Cutting planes
Applied sciences
Cutting planes
Cutting stock problem
Exact sciences and technology
Integer programming
Mathematical programming
Operational research and scientific management
Operational research. Management science
Optimization algorithms
Studies
Valid inequalities
Title Cutting plane algorithms for 0-1 programming based on cardinality cuts
URI https://dx.doi.org/10.1016/j.ejor.2010.01.006
http://econpapers.repec.org/article/eeeejores/v_3a205_3ay_3a2010_3ai_3a2_3ap_3a273-279.htm
https://www.proquest.com/docview/204197540
Volume 205
WOSCitedRecordID wos000276030200005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6860
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001515
  issn: 0377-2217
  databaseCode: AIEXJ
  dateStart: 19950105
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3da9swEBdZMsbK2Ee20axb0cPegosty5b1WLqWfdEO1kHehC3LbUPimDgJ3X-_kyU57rqVbbBAZGEsS8nvJ-l0utMh9DYpchoXmfJAdCUeZVnoZZkEQGKYbXKa8EI2UUs-s9PTZDLhX3q9T84XZjNjZZlcX_Pqv0IN9wBs7Tr7F3C3L4UbkAfQIQXYIf0j4I_WxpS50mas43R2sYD1_6U5d2Hse4EzyZrrh_QklusNA6mZYoVyuTbHO_1SY2-lV7ixdHpEe2BQq1g-u1g3aumzem65Z9UKekecd9UKt_1djI8VYx4hxtvyQJkhM2HEixMTFcCNqcSPOuQh3RHSRC6xky0xkWRujeNGpTA9UNPF0trfBdoEbztrtbaEX3WjdJvMTgVl99CAsIgnfTQ4_HA8-dhOzFp2azaV7I-wPlTG3O_nmn4npzyq0hp6T2HCntxYlwyWqlKyI56cP0WP7boCHxo-PEM9VQ7RA-fWMERPXPgObEfzIdrpnEX5HJ1Y3uCGN3jLGwy8wcAb3OENbniDFyXu8AZr3rxA306Oz4_eezbIhidhuF55MsuKOOcx4YoSlqacZdTPpOSFX9Ai036QikWK8zQKlA4_UMSKK54kPA8zBtLuS9QvF6XaRTinYegrbYRHQhrGMQd5sIAlBI04DZTiIxS4v1RIewK9DoQyE87UcCo0DELDIPxAAAwjNG7LVOb8lTufjhxSwkqQRjIUQKw7y-3fgLWtCmY7Akt6OkJ7Dmdh-1oNL6ABZ7DkGaF3DfRtMQUfqELVYiPCFDoDpN-bHFQZplc6C99KX1kooBeIy9X81T-2fg893Pbg16i_Wq7VG3RfblZX9XLf9oIfKWW_HQ
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Cutting+plane+algorithms+for+0-1+programming+based+on+cardinality+cuts&rft.jtitle=European+journal+of+operational+research&rft.au=Oguz%2C+Osman&rft.date=2010-09-01&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=205&rft.issue=2&rft.spage=273&rft.epage=279&rft_id=info:doi/10.1016%2Fj.ejor.2010.01.006&rft.externalDocID=S0377221710000147
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon