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/jco7.bht:"
download as .bib file
@article{DBLP:journals/jco/BahienseBP03,
author = {Laura Bahiense and
Francisco Barahona and
Oscar Porto},
title = {Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation},
journal = {J. Comb. Optim.},
volume = {7},
number = {3},
pages = {259--282},
year = {2003},
url = {https://doi.org/10.1023/A:1027368621279},
doi = {10.1023/A:1027368621279},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BahienseBP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Bodlaender03,
author = {Hans L. Bodlaender},
title = {Necessary Edges in k-Chordalisations of Graphs},
journal = {J. Comb. Optim.},
volume = {7},
number = {3},
pages = {283--290},
year = {2003},
url = {https://doi.org/10.1023/A:1027320705349},
doi = {10.1023/A:1027320705349},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Bodlaender03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChaovalitwongseKP03,
author = {Wanpracha Art Chaovalitwongse and
Dukwon Kim and
Panos M. Pardalos},
title = {{GRASP} with a New Local Search Scheme for Vehicle Routing Problems
with Time Windows},
journal = {J. Comb. Optim.},
volume = {7},
number = {2},
pages = {179--207},
year = {2003},
url = {https://doi.org/10.1023/A:1024427114516},
doi = {10.1023/A:1024427114516},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChaovalitwongseKP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Chen03,
author = {Chiuyuan Chen},
title = {Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian},
journal = {J. Comb. Optim.},
volume = {7},
number = {1},
pages = {79--86},
year = {2003},
url = {https://doi.org/10.1023/A:1021998507140},
doi = {10.1023/A:1021998507140},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Chen03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenHX03,
author = {Danny Z. Chen and
Xiaobo Hu and
Jinhui Xu},
title = {Computing Optimal Beams in Two and Three Dimensions},
journal = {J. Comb. Optim.},
volume = {7},
number = {2},
pages = {111--136},
year = {2003},
url = {https://doi.org/10.1023/A:1024484412699},
doi = {10.1023/A:1024484412699},
timestamp = {Tue, 13 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenHX03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DengPZ03,
author = {Xiaotie Deng and
Chung Keung Poon and
Yuzhong Zhang},
title = {Approximation Algorithms in Batch Processing},
journal = {J. Comb. Optim.},
volume = {7},
number = {3},
pages = {247--257},
year = {2003},
url = {https://doi.org/10.1023/A:1027316504440},
doi = {10.1023/A:1027316504440},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/DengPZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DyachkovEMRTTVW03,
author = {Arkadii G. D'yachkov and
P{\'{e}}ter L. Erd{\"{o}}s and
Anthony J. Macula and
Vyacheslav V. Rykov and
David C. Torney and
Chang{-}Shung Tung and
Pavel A. Vilenkin and
P. Scott White},
title = {Exordium for {DNA} Codes},
journal = {J. Comb. Optim.},
volume = {7},
number = {4},
pages = {369--379},
year = {2003},
url = {https://doi.org/10.1023/B:JOCO.0000017385.39168.0d},
doi = {10.1023/B:JOCO.0000017385.39168.0D},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DyachkovEMRTTVW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FeliciG03,
author = {Giovanni Felici and
Claudio Gentile},
title = {Zero-Lifting for Integer Block Structured Problems},
journal = {J. Comb. Optim.},
volume = {7},
number = {2},
pages = {161--167},
year = {2003},
url = {https://doi.org/10.1023/A:1024423013607},
doi = {10.1023/A:1024423013607},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FeliciG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GlassP03,
author = {Celia A. Glass and
Adam Pr{\"{u}}gel{-}Bennett},
title = {Genetic Algorithm for Graph Coloring: Exploration of Galinier and
Hao's Algorithm},
journal = {J. Comb. Optim.},
volume = {7},
number = {3},
pages = {229--236},
year = {2003},
url = {https://doi.org/10.1023/A:1027312403532},
doi = {10.1023/A:1027312403532},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/GlassP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HuangW03,
author = {Tayuan Huang and
Chih{-}Wen Weng},
title = {A Note on Decoding of Superimposed Codes},
journal = {J. Comb. Optim.},
volume = {7},
number = {4},
pages = {381--384},
year = {2003},
url = {https://doi.org/10.1023/B:JOCO.0000017386.09330.70},
doi = {10.1023/B:JOCO.0000017386.09330.70},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HuangW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HwangL03,
author = {Frank K. Hwang and
Wen{-}Dar Lin},
title = {The Incremental Group Testing Model for Gap Closing in Sequencing
Long Molecules},
journal = {J. Comb. Optim.},
volume = {7},
number = {4},
pages = {327--337},
year = {2003},
url = {https://doi.org/10.1023/B:JOCO.0000017381.11696.c6},
doi = {10.1023/B:JOCO.0000017381.11696.C6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HwangL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HwangL03a,
author = {Frank K. Hwang and
Yu{-}Chi Liu},
title = {Random Pooling Designs Under Various Structures},
journal = {J. Comb. Optim.},
volume = {7},
number = {4},
pages = {339--352},
year = {2003},
url = {https://doi.org/10.1023/B:JOCO.0000017382.83399.0b},
doi = {10.1023/B:JOCO.0000017382.83399.0B},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/HwangL03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KalirS03,
author = {Adar A. Kalir and
Subhash C. Sarin},
title = {Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming
Problem with Sublot-Attached Setups},
journal = {J. Comb. Optim.},
volume = {7},
number = {1},
pages = {23--44},
year = {2003},
url = {https://doi.org/10.1023/A:1021942422161},
doi = {10.1023/A:1021942422161},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KalirS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KaoSS03,
author = {Ming{-}Yang Kao and
Jared Samet and
Wing{-}Kin Sung},
title = {The Enhanced Double Digest Problem for {DNA} Physical Mapping},
journal = {J. Comb. Optim.},
volume = {7},
number = {1},
pages = {69--78},
year = {2003},
url = {https://doi.org/10.1023/A:1021946523069},
doi = {10.1023/A:1021946523069},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/KaoSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Lee03,
author = {Jon Lee},
title = {Cropped Cubes},
journal = {J. Comb. Optim.},
volume = {7},
number = {2},
pages = {169--178},
year = {2003},
url = {https://doi.org/10.1023/A:1024475030446},
doi = {10.1023/A:1024475030446},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Lee03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiZ03,
author = {Yusheng Li and
Wenan Zang},
title = {The Independence Number of Graphs with a Forbidden Cycle and Ramsey
Numbers},
journal = {J. Comb. Optim.},
volume = {7},
number = {4},
pages = {353--359},
year = {2003},
url = {https://doi.org/10.1023/B:JOCO.0000017383.13275.17},
doi = {10.1023/B:JOCO.0000017383.13275.17},
timestamp = {Wed, 05 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuLX03,
author = {Hongwei Liu and
Sanyang Liu and
Fengmin Xu},
title = {A Tight Semidefinite Relaxation of the {MAX} {CUT} Problem},
journal = {J. Comb. Optim.},
volume = {7},
number = {3},
pages = {237--245},
year = {2003},
url = {https://doi.org/10.1023/A:1027364420370},
doi = {10.1023/A:1027364420370},
timestamp = {Tue, 13 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/LiuLX03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuZ03,
author = {Zhenhong Liu and
Jianzhong Zhang},
title = {On Inverse Problems of Optimum Perfect Matching},
journal = {J. Comb. Optim.},
volume = {7},
number = {3},
pages = {215--228},
year = {2003},
url = {https://doi.org/10.1023/A:1027305419461},
doi = {10.1023/A:1027305419461},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Macula03,
author = {Anthony J. Macula},
title = {Trivial Two-Stage Group Testing with High Error Rates},
journal = {J. Comb. Optim.},
volume = {7},
number = {4},
pages = {361--368},
year = {2003},
url = {https://doi.org/10.1023/B:JOCO.0000017384.94868.45},
doi = {10.1023/B:JOCO.0000017384.94868.45},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Macula03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NagamochiE03,
author = {Hiroshi Nagamochi and
Peter Eades},
title = {An Edge-Splitting Algorithm in Planar Graphs},
journal = {J. Comb. Optim.},
volume = {7},
number = {2},
pages = {137--159},
year = {2003},
url = {https://doi.org/10.1023/A:1024470929537},
doi = {10.1023/A:1024470929537},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/NagamochiE03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ParkWLWZ03,
author = {Haesun Park and
Weili Wu and
Zhen Liu and
Xiaoyu Wu and
Hong G. Zhao},
title = {{DNA} Screening, Pooling Design and Simplicial Complex},
journal = {J. Comb. Optim.},
volume = {7},
number = {4},
pages = {389--394},
year = {2003},
url = {https://doi.org/10.1023/B:JOCO.0000017388.06583.04},
doi = {10.1023/B:JOCO.0000017388.06583.04},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ParkWLWZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/PatkarN03,
author = {Sachin B. Patkar and
H. Narayanan},
title = {Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network
and its Connections with Principal Partition},
journal = {J. Comb. Optim.},
volume = {7},
number = {1},
pages = {45--68},
year = {2003},
url = {https://doi.org/10.1023/A:1021994406231},
doi = {10.1023/A:1021994406231},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/PatkarN03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Rios-MercadoB03,
author = {Roger Z. R{\'{\i}}os{-}Mercado and
Jonathan F. Bard},
title = {The Flow Shop Scheduling Polyhedron with Setup Time},
journal = {J. Comb. Optim.},
volume = {7},
number = {3},
pages = {291--318},
year = {2003},
url = {https://doi.org/10.1023/A:1027372722187},
doi = {10.1023/A:1027372722187},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Rios-MercadoB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShragowitzYL03,
author = {Eugene Shragowitz and
Habib Youssef and
Bing Lu},
title = {Iterative Converging Algorithms for Computing Bounds on Durations
of Activities in Pert and Pert-Like Models},
journal = {J. Comb. Optim.},
volume = {7},
number = {1},
pages = {5--22},
year = {2003},
url = {https://doi.org/10.1023/A:1021964105322},
doi = {10.1023/A:1021964105322},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ShragowitzYL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/VasquezH03,
author = {Michel Vasquez and
Jin{-}Kao Hao},
title = {Upper Bounds for the {SPOT} 5 Daily Photograph Scheduling Problem},
journal = {J. Comb. Optim.},
volume = {7},
number = {1},
pages = {87--103},
year = {2003},
url = {https://doi.org/10.1023/A:1021950608048},
doi = {10.1023/A:1021950608048},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/VasquezH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuLWH03,
author = {Weili Wu and
Chungui Li and
Xiaoyu Wu and
Xiao Huang},
title = {Decoding in Pooling Designs},
journal = {J. Comb. Optim.},
volume = {7},
number = {4},
pages = {385--388},
year = {2003},
url = {https://doi.org/10.1023/B:JOCO.0000017387.34879.58},
doi = {10.1023/B:JOCO.0000017387.34879.58},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/WuLWH03.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-06-06 01:38 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:
