Optimization via enumeration: a new algorithm for the Max Cut Problem

Uložené v:
Podrobná bibliografia
Vydané v:Mathematical programming Ročník 90; číslo 2; s. 273 - 290
Hlavní autori: Galluccio, Anna, Loebl, Martin, Vondrák, Jan
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Heidelberg Springer 01.04.2001
Predmet:
ISSN:0025-5610
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Author Vondrák, Jan
Galluccio, Anna
Loebl, Martin
Author_xml – sequence: 1
  givenname: Anna
  surname: Galluccio
  fullname: Galluccio, Anna
– sequence: 2
  givenname: Martin
  surname: Loebl
  fullname: Loebl, Martin
– sequence: 3
  givenname: Jan
  surname: Vondrák
  fullname: Vondrák, Jan
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=959094$$DView record in Pascal Francis
BookMark eNptkEtLAzEUhbOoYFvd-AsC7oTRm2Se7mSoVRhpF90PdzKJjcyLJPX16522iiCuLpf7ncM9Z0YmXd8pQi4YXDOA5GZdAABjIY8mZArAoyCKGZySmXMv-4tI0ylZrAZvWvOJ3vQdfTVIVbdrlT3stxRpp94oNs-9NX7bUt1b6reKPuE7zXeerm1fNao9IycaG6fOv-ecbO4Xm_whKFbLx_yuCKTgwgcx8rhOeMhZhalglaywZnU8vlKHodZZUnFRSUiiiAstQMdQp6BUOiKKgRRzcnm0HdBJbLTFThpXDta0aD_KLMogC0cKjpS0vXNW6VIaf8jjLZqmZFDu-yl_-xklV38kP57_wF-3_mh6
CODEN MHPGA4
CitedBy_id crossref_primary_10_1016_j_aam_2009_12_001
crossref_primary_10_1016_j_tcs_2012_02_036
crossref_primary_10_1145_3664648
crossref_primary_10_1002_rsa_20471
crossref_primary_10_1007_s00267_023_01837_6
crossref_primary_10_1007_s10955_007_9436_4
crossref_primary_10_1137_20M1318523
crossref_primary_10_1287_ijoc_2024_0812
crossref_primary_10_1016_j_bpc_2004_12_010
crossref_primary_10_3390_e18040151
crossref_primary_10_1016_S0024_3795_02_00330_0
crossref_primary_10_1007_s10955_007_9336_7
crossref_primary_10_1088_1742_5468_2006_10_L10001
ContentType Journal Article
Copyright 2001 INIST-CNRS
Copyright_xml – notice: 2001 INIST-CNRS
DBID AAYXX
CITATION
IQODW
DOI 10.1007/PL00011425
DatabaseName CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
Applied Sciences
EndPage 290
ExternalDocumentID 959094
10_1007_PL00011425
GroupedDBID --K
--Z
-Y2
-~C
-~X
.4S
.86
.DC
.VR
06D
0R~
0VY
199
1B1
1N0
1OL
1SB
203
28-
29M
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
6TJ
78A
7WY
88I
8AO
8FE
8FG
8FL
8TC
8UJ
8VB
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAPKM
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYXX
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDBF
ABDZT
ABECU
ABFSG
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACNCT
ACOKC
ACOMO
ACPIV
ACSTC
ACUHS
ACZOJ
ADHHG
ADHIR
ADHKG
ADIMF
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADXHL
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMOZ
AEMSY
AENEX
AEOHA
AEPYU
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFEXP
AFFHD
AFFNX
AFGCZ
AFHIU
AFKRA
AFLOW
AFOHR
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGQPQ
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHPBZ
AHQJS
AHSBF
AHWEU
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AIXLP
AJBLW
AJRNO
AJZVZ
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMVHM
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYJHY
AZFZN
AZQEC
B-.
B0M
BA0
BAPOH
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
CITATION
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EAD
EAP
EBA
EBLON
EBR
EBS
EBU
ECS
EDO
EIOEI
EJD
EMI
EMK
EPL
ESBYG
EST
ESX
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ7
GQ8
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
H~9
I-F
I09
IAO
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K1G
K60
K6V
K6~
K7-
KDC
KOV
KOW
L6V
LAS
LLZTM
M0C
M2P
M4Y
M7S
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQ-
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
P19
P2P
P62
P9R
PF0
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
QWB
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RPZ
RSV
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCLPG
SDD
SDH
SDM
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TH9
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WH7
WK8
XPP
YLTOR
Z45
ZL0
ZMTXR
ZWQNP
~02
~8M
~EX
AAYZH
AESKC
IQODW
RIG
ID FETCH-LOGICAL-c323t-6a26d72421ba831bcbad1d6013d44ff97b23bc075523f30f60d80ee8d60e10c3
IEDL.DBID RSV
ISICitedReferencesCount 26
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000168332800004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0025-5610
IngestDate Mon Jul 21 09:16:58 EDT 2025
Tue Nov 18 22:23:10 EST 2025
Sat Nov 29 05:48:58 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Cutting
Statistical analysis
Enumeration
Generating function
Polynomial method
Combinatorial optimization
Enumeration(counting)
Polynomial time
Language English
License http://www.springer.com/tdm
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c323t-6a26d72421ba831bcbad1d6013d44ff97b23bc075523f30f60d80ee8d60e10c3
PageCount 18
ParticipantIDs pascalfrancis_primary_959094
crossref_citationtrail_10_1007_PL00011425
crossref_primary_10_1007_PL00011425
PublicationCentury 2000
PublicationDate 2001-04-01
PublicationDateYYYYMMDD 2001-04-01
PublicationDate_xml – month: 04
  year: 2001
  text: 2001-04-01
  day: 01
PublicationDecade 2000
PublicationPlace Heidelberg
PublicationPlace_xml – name: Heidelberg
PublicationTitle Mathematical programming
PublicationYear 2001
Publisher Springer
Publisher_xml – name: Springer
SSID ssj0001388
Score 1.7273524
SourceID pascalfrancis
crossref
SourceType Index Database
Enrichment Source
StartPage 273
SubjectTerms Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
Title Optimization via enumeration: a new algorithm for the Max Cut Problem
Volume 90
WOSCitedRecordID wos000168332800004&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: PRVAVX
  databaseName: Springer Journals New Starts & Take-Overs Collection
  issn: 0025-5610
  databaseCode: RSV
  dateStart: 19970101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  omitProxy: false
  ssIdentifier: ssj0001388
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3fa8IwEA4ie9gY-z3m5kZgvuyhrE1qm-5tiLIHdcJk-CaXNNkEf6FV9ufvampV2MDHwiVt79rkO3L3fYRUmKhCIIV2PM8ox_eZckAycGQAUEW8LzyzinQzbLdFrxd1CqTy7wn-c6fp2o7PtJPcC2yT1sdnvtx6XIi1LmsKBrY4SDdDd3ad4ynM0QHGKldsbSeN0_0e5IycZHCRvtr4npOCHl-Qoy0SQbxq5cyr80tSf8c1YJQ1V9LlAGha665tnF8oUITRFIZfk9kg-R5RhKwUR9MW_NDaIqEdqy9zRbqNerf25mRSCY7ijCdOACyIw_R4V4LgnlQSYi_GZIvHvm9MFErGpUJ4gHmn4a4J3Fi4Wgs00Z6r-DUpjidjfUMouBBKF7RQ-KpxVI1iw5mKGP7smNr4qkSe1p7sq4xGPFWzGPbXBMgbP5XIY247teQZf1qVdwKSm-LNMfm83WuSO3Joq8PSmpoyKSazhb4nB2qZDOazh9UX8wt91Ld2
linkProvider Springer Nature
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=Optimization+via+enumeration%3A+a+new+algorithm+for+the+Max+Cut+Problem&rft.jtitle=Mathematical+programming&rft.au=Galluccio%2C+Anna&rft.au=Loebl%2C+Martin&rft.au=Vondr%C3%A1k%2C+Jan&rft.date=2001-04-01&rft.issn=0025-5610&rft.volume=90&rft.issue=2&rft.spage=273&rft.epage=290&rft_id=info:doi/10.1007%2FPL00011425&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_PL00011425
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0025-5610&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0025-5610&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0025-5610&client=summon