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/jco8.bht:"
download as .bib file
@article{DBLP:journals/jco/Aardal04,
author = {Karen I. Aardal},
title = {Comments on the Paper: Attacking the Market Split Problem with Lattice
Point Enumeration},
journal = {J. Comb. Optim.},
volume = {8},
number = {2},
pages = {147--149},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000031416.70875.00},
doi = {10.1023/B:JOCO.0000031416.70875.00},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Aardal04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AgeevS04,
author = {Alexander A. Ageev and
Maxim Sviridenko},
title = {Pipage Rounding: {A} New Method of Constructing Algorithms with Proven
Performance Guarantee},
journal = {J. Comb. Optim.},
volume = {8},
number = {3},
pages = {307--328},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000038913.96607.c2},
doi = {10.1023/B:JOCO.0000038913.96607.C2},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AgeevS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Balas04,
author = {Egon Balas},
title = {Logical Constraints as Cardinality Rules: Tight Representation},
journal = {J. Comb. Optim.},
volume = {8},
number = {2},
pages = {115--128},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000031413.33955.62},
doi = {10.1023/B:JOCO.0000031413.33955.62},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Balas04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BarbosaAN04,
author = {Valmir Carneiro Barbosa and
Carlos A. G. Assis and
Josina O. do Nascimento},
title = {Two Novel Evolutionary Formulations of the Graph Coloring Problem},
journal = {J. Comb. Optim.},
volume = {8},
number = {1},
pages = {41--63},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000021937.26468.b2},
doi = {10.1023/B:JOCO.0000021937.26468.B2},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BarbosaAN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BarbosaC04,
author = {Valmir Carneiro Barbosa and
Luciana C. D. Campos},
title = {A Novel Evolutionary Formulation of the Maximum Independent Set Problem},
journal = {J. Comb. Optim.},
volume = {8},
number = {4},
pages = {419--437},
year = {2004},
url = {https://doi.org/10.1007/s10878-004-4835-9},
doi = {10.1007/S10878-004-4835-9},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BarbosaC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChangCC04,
author = {Gerard J. Chang and
Chiuyuan Chen and
Yaping Chen},
title = {Vertex and Tree Arboricities of Graphs},
journal = {J. Comb. Optim.},
volume = {8},
number = {3},
pages = {295--306},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000038912.82046.17},
doi = {10.1023/B:JOCO.0000038912.82046.17},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChangCC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenDZ04,
author = {Bo Chen and
Xiaotie Deng and
Wenan Zang},
title = {On-Line Scheduling a Batch Processing System to Minimize Total Weighted
Job Completion Time},
journal = {J. Comb. Optim.},
volume = {8},
number = {1},
pages = {85--95},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000021939.01674.1f},
doi = {10.1023/B:JOCO.0000021939.01674.1F},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ChenDZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/DangK04,
author = {Chuangyin Dang and
Liying Kang},
title = {Batch-Processing Scheduling with Setup Times},
journal = {J. Comb. Optim.},
volume = {8},
number = {2},
pages = {137--146},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000031415.55216.2a},
doi = {10.1023/B:JOCO.0000031415.55216.2A},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/DangK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FernandezM04,
author = {Elena Fern{\'{a}}ndez and
Oscar Meza},
title = {Even Cycles and Perfect Matching Problems with Side Constraints},
journal = {J. Comb. Optim.},
volume = {8},
number = {3},
pages = {381--396},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000038916.51082.5e},
doi = {10.1023/B:JOCO.0000038916.51082.5E},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FernandezM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FrangioniNS04,
author = {Antonio Frangioni and
Emiliano Necciari and
Maria Grazia Scutell{\`{a}}},
title = {A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine
Scheduling Problems},
journal = {J. Comb. Optim.},
volume = {8},
number = {2},
pages = {195--220},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000031420.05971.29},
doi = {10.1023/B:JOCO.0000031420.05971.29},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/FrangioniNS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Fujito04,
author = {Toshihiro Fujito},
title = {On Combinatorial Approximation of Covering 0-1 Integer Programs and
Partial Set Cover},
journal = {J. Comb. Optim.},
volume = {8},
number = {4},
pages = {439--452},
year = {2004},
url = {https://doi.org/10.1007/s10878-004-4836-8},
doi = {10.1007/S10878-004-4836-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Fujito04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GladkySS04,
author = {Andrei A. Gladky and
Yakov M. Shafransky and
Vitaly A. Strusevich},
title = {Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints},
journal = {J. Comb. Optim.},
volume = {8},
number = {1},
pages = {13--28},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000021935.66577.09},
doi = {10.1023/B:JOCO.0000021935.66577.09},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GladkySS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Heuberger04,
author = {Clemens Heuberger},
title = {Inverse Combinatorial Optimization: {A} Survey on Problems, Methods,
and Results},
journal = {J. Comb. Optim.},
volume = {8},
number = {3},
pages = {329--361},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000038914.26975.9b},
doi = {10.1023/B:JOCO.0000038914.26975.9B},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Heuberger04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Hifi04,
author = {Mhand Hifi},
title = {Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional
Cutting Stock Problems},
journal = {J. Comb. Optim.},
volume = {8},
number = {1},
pages = {65--84},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000021938.49750.91},
doi = {10.1023/B:JOCO.0000021938.49750.91},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Hifi04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KellererP04,
author = {Hans Kellerer and
Ulrich Pferschy},
title = {Improved Dynamic Programming in Connection with an {FPTAS} for the
Knapsack Problem},
journal = {J. Comb. Optim.},
volume = {8},
number = {1},
pages = {5--11},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000021934.29833.6b},
doi = {10.1023/B:JOCO.0000021934.29833.6B},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KellererP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KlerkPW04,
author = {Etienne de Klerk and
Dmitrii V. Pasechnik and
Joost P. Warners},
title = {On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the
theta-Function},
journal = {J. Comb. Optim.},
volume = {8},
number = {3},
pages = {267--294},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000038911.67280.3f},
doi = {10.1023/B:JOCO.0000038911.67280.3F},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/KlerkPW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LinJ04,
author = {Guohui Lin and
Tao Jiang},
title = {A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition},
journal = {J. Comb. Optim.},
volume = {8},
number = {2},
pages = {183--194},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000031419.12290.2b},
doi = {10.1023/B:JOCO.0000031419.12290.2B},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LinJ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LodiMV04,
author = {Andrea Lodi and
Silvano Martello and
Daniele Vigo},
title = {Models and Bounds for Two-Dimensional Level Packing Problems},
journal = {J. Comb. Optim.},
volume = {8},
number = {3},
pages = {363--379},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000038915.62826.79},
doi = {10.1023/B:JOCO.0000038915.62826.79},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LodiMV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ProkopyevP04,
author = {Oleg A. Prokopyev and
Panos M. Pardalos},
title = {On Approximability of Boolean Formula Minimization},
journal = {J. Comb. Optim.},
volume = {8},
number = {2},
pages = {129--135},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000031414.39556.3a},
doi = {10.1023/B:JOCO.0000031414.39556.3A},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ProkopyevP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ProkopyevP04a,
author = {Oleg A. Prokopyev and
Panos M. Pardalos},
title = {Minimum elsilon-equivalent Circuit Size Problem},
journal = {J. Comb. Optim.},
volume = {8},
number = {4},
pages = {495--502},
year = {2004},
url = {https://doi.org/10.1007/s10878-004-4839-5},
doi = {10.1007/S10878-004-4839-5},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/ProkopyevP04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Roupin04,
author = {Fr{\'{e}}d{\'{e}}ric Roupin},
title = {From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite
Relaxations for Bivalent Quadratic Problems},
journal = {J. Comb. Optim.},
volume = {8},
number = {4},
pages = {469--493},
year = {2004},
url = {https://doi.org/10.1007/s10878-004-4838-6},
doi = {10.1007/S10878-004-4838-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Roupin04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/SarinP04,
author = {Subhash C. Sarin and
Divya Prakash},
title = {Equal Processing Time Bicriteria Scheduling on Parallel Machines},
journal = {J. Comb. Optim.},
volume = {8},
number = {3},
pages = {227--240},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000038909.06086.ed},
doi = {10.1023/B:JOCO.0000038909.06086.ED},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/SarinP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ShyuTL04,
author = {Shyong Jian Shyu and
Yin{-}Te Tsai and
Richard C. T. Lee},
title = {The Minimal Spanning Tree Preservation Approaches for {DNA} Multiple
Sequence Alignment and Evolutionary Tree Construction},
journal = {J. Comb. Optim.},
volume = {8},
number = {4},
pages = {453--468},
year = {2004},
url = {https://doi.org/10.1007/s10878-004-4837-7},
doi = {10.1007/S10878-004-4837-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ShyuTL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Sorensen04,
author = {Michael Malmros S{\o}rensen},
title = {b-Tree Facets for the Simple Graph Partitioning Polytope},
journal = {J. Comb. Optim.},
volume = {8},
number = {2},
pages = {151--170},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000031417.96218.26},
doi = {10.1023/B:JOCO.0000031417.96218.26},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Sorensen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Wu04,
author = {Bang Ye Wu},
title = {Constructing the Maximum Consensus Tree from Rooted Triples},
journal = {J. Comb. Optim.},
volume = {8},
number = {1},
pages = {29--39},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000021936.04215.68},
doi = {10.1023/B:JOCO.0000021936.04215.68},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Wu04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Xu04,
author = {Jun{-}Ming Xu},
title = {Wide Diameters of Cartesian Product Graphs and Digraphs},
journal = {J. Comb. Optim.},
volume = {8},
number = {2},
pages = {171--181},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000031418.45051.8b},
doi = {10.1023/B:JOCO.0000031418.45051.8B},
timestamp = {Thu, 28 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Xu04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/XuLX04,
author = {Jinbo Xu and
Ming Li and
Ying Xu},
title = {Protein Threading by Linear Programming: Theoretical Analysis and
Computational Results},
journal = {J. Comb. Optim.},
volume = {8},
number = {4},
pages = {403--418},
year = {2004},
url = {https://doi.org/10.1007/s10878-004-4834-x},
doi = {10.1007/S10878-004-4834-X},
timestamp = {Tue, 07 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/XuLX04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YangW04,
author = {Boting Yang and
Cao An Wang},
title = {Minimal Tetrahedralizations of a Class of Polyhedra},
journal = {J. Comb. Optim.},
volume = {8},
number = {3},
pages = {241--265},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000038910.06360.0a},
doi = {10.1023/B:JOCO.0000038910.06360.0A},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YangW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhouN04,
author = {Xiao Zhou and
Takao Nishizeki},
title = {Algorithm for the Cost Edge-Coloring of Trees},
journal = {J. Comb. Optim.},
volume = {8},
number = {1},
pages = {97--108},
year = {2004},
url = {https://doi.org/10.1023/B:JOCO.0000021940.40066.0c},
doi = {10.1023/B:JOCO.0000021940.40066.0C},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhouN04.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-04 05:21 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:
