Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jco/jco6.bht:"
download as .bib file
@article{DBLP:journals/jco/AnjosW02,
author = {Miguel F. Anjos and
Henry Wolkowicz},
title = {Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks},
journal = {J. Comb. Optim.},
volume = {6},
number = {3},
pages = {237--270},
year = {2002},
url = {https://doi.org/10.1023/A:1014895808844},
doi = {10.1023/A:1014895808844},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/AnjosW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BehjatKV02,
author = {Laleh Behjat and
Dorothy Kucar and
Anthony Vannelli},
title = {A Novel Eigenvector Technique for Large Scale Combinatorial Problems
in {VLSI} Layout},
journal = {J. Comb. Optim.},
volume = {6},
number = {3},
pages = {271--286},
year = {2002},
url = {https://doi.org/10.1023/A:1014847925683},
doi = {10.1023/A:1014847925683},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BehjatKV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BendaliMM02,
author = {Fatiha Bendali and
Ali Ridha Mahjoub and
Jean Mailfert},
title = {Composition of Graphs and the Triangle-Free Subgraph Polytope},
journal = {J. Comb. Optim.},
volume = {6},
number = {4},
pages = {359--381},
year = {2002},
url = {https://doi.org/10.1023/A:1019518830361},
doi = {10.1023/A:1019518830361},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BendaliMM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BusyginBP02,
author = {Stanislav Busygin and
Sergiy Butenko and
Panos M. Pardalos},
title = {A Heuristic for the Maximum Independent Set Problem Based on Optimization
of a Quadratic Over a Sphere},
journal = {J. Comb. Optim.},
volume = {6},
number = {3},
pages = {287--297},
year = {2002},
url = {https://doi.org/10.1023/A:1014899909753},
doi = {10.1023/A:1014899909753},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BusyginBP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CalinescuW02,
author = {Gruia C{\u{a}}linescu and
Peng{-}Jun Wan},
title = {Traffic Partition in {WDM/SONET} Rings to Minimize {SONET} ADMs},
journal = {J. Comb. Optim.},
volume = {6},
number = {4},
pages = {425--453},
year = {2002},
url = {https://doi.org/10.1023/A:1019525904862},
doi = {10.1023/A:1019525904862},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CalinescuW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CapraraR02,
author = {Alberto Caprara and
Romeo Rizzi},
title = {Improved Approximation for Breakpoint Graph Decomposition and Sorting
by Reversals},
journal = {J. Comb. Optim.},
volume = {6},
number = {2},
pages = {157--182},
year = {2002},
url = {https://doi.org/10.1023/A:1013851611274},
doi = {10.1023/A:1013851611274},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/CapraraR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChangCH02,
author = {Hsun{-}Wen Chang and
Rong{-}Jaye Chen and
Frank K. Hwang},
title = {The Structural Birnbaum Importance of Consecutive-k Systems},
journal = {J. Comb. Optim.},
volume = {6},
number = {2},
pages = {183--197},
year = {2002},
url = {https://doi.org/10.1023/A:1013803728112},
doi = {10.1023/A:1013803728112},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChangCH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenHL02,
author = {Shi Ping Chen and
Yong He and
Guo{-}Hui Lin},
title = {3-Partitioning Problems for Maximizing the Minimum Load},
journal = {J. Comb. Optim.},
volume = {6},
number = {1},
pages = {67--80},
year = {2002},
url = {https://doi.org/10.1023/A:1013370208101},
doi = {10.1023/A:1013370208101},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenHL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DengLW02,
author = {Xiaotie Deng and
Guojun Li and
Lusheng Wang},
title = {Center and Distinguisher for Strings with Unbounded Alphabet},
journal = {J. Comb. Optim.},
volume = {6},
number = {4},
pages = {383--400},
year = {2002},
url = {https://doi.org/10.1023/A:1019545003953},
doi = {10.1023/A:1019545003953},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DengLW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/EricssonRP02,
author = {M. Ericsson and
Mauricio G. C. Resende and
Panos M. Pardalos},
title = {A Genetic Algorithm for the Weight Setting Problem in {OSPF} Routing},
journal = {J. Comb. Optim.},
volume = {6},
number = {3},
pages = {299--333},
year = {2002},
url = {https://doi.org/10.1023/A:1014852026591},
doi = {10.1023/A:1014852026591},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/EricssonRP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GuCGHJ02,
author = {Xiaodong Gu and
Guoliang Chen and
Jun Gu and
Liusheng Huang and
Yunjae Jung},
title = {Performance Analysis and Improvement for Some Linear On-Line Bin-Packing
Algorithms},
journal = {J. Comb. Optim.},
volume = {6},
number = {4},
pages = {455--471},
year = {2002},
url = {https://doi.org/10.1023/A:1019577921700},
doi = {10.1023/A:1019577921700},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GuCGHJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HanafiG02,
author = {Sa{\"{\i}}d Hanafi and
Fred W. Glover},
title = {Resolution Search and Dynamic Branch-and-Bound},
journal = {J. Comb. Optim.},
volume = {6},
number = {4},
pages = {401--423},
year = {2002},
url = {https://doi.org/10.1023/A:1019573820792},
doi = {10.1023/A:1019573820792},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HanafiG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HeT02,
author = {Yong He and
Zhiyi Tan},
title = {Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion
Time},
journal = {J. Comb. Optim.},
volume = {6},
number = {2},
pages = {199--206},
year = {2002},
url = {https://doi.org/10.1023/A:1013855712183},
doi = {10.1023/A:1013855712183},
timestamp = {Thu, 28 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HeT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HifiS02,
author = {Mhand Hifi and
Slim Sadfi},
title = {The Knapsack Sharing Problem: An Exact Algorithm},
journal = {J. Comb. Optim.},
volume = {6},
number = {1},
pages = {35--54},
year = {2002},
url = {https://doi.org/10.1023/A:1013385216761},
doi = {10.1023/A:1013385216761},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HifiS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/JamesS02,
author = {J. C. James and
Sa{\"{\i}}d Salhi},
title = {A Tabu Search Heuristic for the Location of Multi-Type Protection
Devices on Electrical Supply Tree Networks},
journal = {J. Comb. Optim.},
volume = {6},
number = {1},
pages = {81--98},
year = {2002},
url = {https://doi.org/10.1023/A:1013322309009},
doi = {10.1023/A:1013322309009},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/JamesS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KrivelevichV02,
author = {Michael Krivelevich and
Van H. Vu},
title = {Approximating the Independence Number and the Chromatic Number in
Expected Polynomial Time},
journal = {J. Comb. Optim.},
volume = {6},
number = {2},
pages = {143--155},
year = {2002},
url = {https://doi.org/10.1023/A:1013899527204},
doi = {10.1023/A:1013899527204},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KrivelevichV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Lee02,
author = {Jon Lee},
title = {All-Different Polytopes},
journal = {J. Comb. Optim.},
volume = {6},
number = {3},
pages = {335--352},
year = {2002},
url = {https://doi.org/10.1023/A:1014804110661},
doi = {10.1023/A:1014804110661},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Lee02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MaarenD02,
author = {Hans van Maaren and
Chuangyin Dang},
title = {Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs},
journal = {J. Comb. Optim.},
volume = {6},
number = {2},
pages = {133--142},
year = {2002},
url = {https://doi.org/10.1023/A:1013847510365},
doi = {10.1023/A:1013847510365},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MaarenD02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PardalosW02,
author = {Panos M. Pardalos and
Henry Wolkowicz},
title = {Preface},
journal = {J. Comb. Optim.},
volume = {6},
number = {3},
pages = {235--236},
year = {2002},
url = {https://doi.org/10.1023/A:1014834024774},
doi = {10.1023/A:1014834024774},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PardalosW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/RandallMS02,
author = {Marcus Randall and
Graham McMahon and
Stephen Sugden},
title = {A Simulated Annealing Approach to Communication Network Design},
journal = {J. Comb. Optim.},
volume = {6},
number = {1},
pages = {55--65},
year = {2002},
url = {https://doi.org/10.1023/A:1013337324030},
doi = {10.1023/A:1013337324030},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/RandallMS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SunG02,
author = {Jie Sun and
Y. Gu},
title = {A Parametric Approach for a Nonlinear Discrete Location Problem},
journal = {J. Comb. Optim.},
volume = {6},
number = {2},
pages = {119--132},
year = {2002},
url = {https://doi.org/10.1023/A:1013802826295},
doi = {10.1023/A:1013802826295},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SunG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Wassermann02,
author = {Alfred Wassermann},
title = {Attacking the Market Split Problem with Lattice Point Enumeration},
journal = {J. Comb. Optim.},
volume = {6},
number = {1},
pages = {5--16},
year = {2002},
url = {https://doi.org/10.1023/A:1013355015853},
doi = {10.1023/A:1013355015853},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Wassermann02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YangY02,
author = {Jian Yang and
Gang Yu},
title = {On the Robust Single Machine Scheduling Problem},
journal = {J. Comb. Optim.},
volume = {6},
number = {1},
pages = {17--33},
year = {2002},
url = {https://doi.org/10.1023/A:1013333232691},
doi = {10.1023/A:1013333232691},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YangY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangL02,
author = {Jianzhong Zhang and
Zhenhong Liu},
title = {A General Model of Some Inverse Combinatorial Optimization Problems
and Its Solution Method Under l-Norm},
journal = {J. Comb. Optim.},
volume = {6},
number = {2},
pages = {207--227},
year = {2002},
url = {https://doi.org/10.1023/A:1013807829021},
doi = {10.1023/A:1013807829021},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhuQ02,
author = {Binhai Zhu and
Zhongping Qin},
title = {New Approximation Algorithms for Map Labeling with Sliding Labels},
journal = {J. Comb. Optim.},
volume = {6},
number = {1},
pages = {99--110},
year = {2002},
url = {https://doi.org/10.1023/A:1013326409918},
doi = {10.1023/A:1013326409918},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhuQ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-04-25 05:46 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
