default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 8
Volume 8, Number 1, March 2004
- Hans Kellerer, Ulrich Pferschy
:
Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. 5-11 - Andrei A. Gladky, Yakov M. Shafransky, Vitaly A. Strusevich:
Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints. 13-28 - Bang Ye Wu:
Constructing the Maximum Consensus Tree from Rooted Triples. 29-39 - Valmir Carneiro Barbosa, Carlos A. G. Assis, Josina O. do Nascimento:
Two Novel Evolutionary Formulations of the Graph Coloring Problem. 41-63 - Mhand Hifi:
Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems. 65-84 - Bo Chen, Xiaotie Deng, Wenan Zang:
On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. 85-95 - Xiao Zhou, Takao Nishizeki:
Algorithm for the Cost Edge-Coloring of Trees. 97-108
Volume 8, Number 2, June 2004
- Egon Balas:
Logical Constraints as Cardinality Rules: Tight Representation. 115-128 - Oleg A. Prokopyev, Panos M. Pardalos:
On Approximability of Boolean Formula Minimization. 129-135 - Chuangyin Dang, Liying Kang:
Batch-Processing Scheduling with Setup Times. 137-146 - Karen I. Aardal:
Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration. 147-149 - Michael Malmros Sørensen:
b-Tree Facets for the Simple Graph Partitioning Polytope. 151-170 - Jun-Ming Xu:
Wide Diameters of Cartesian Product Graphs and Digraphs. 171-181 - Guohui Lin, Tao Jiang:
A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition. 183-194 - Antonio Frangioni, Emiliano Necciari, Maria Grazia Scutellà:
A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems. 195-220
Volume 8, Number 3, September 2004
- Subhash C. Sarin, Divya Prakash:
Equal Processing Time Bicriteria Scheduling on Parallel Machines. 227-240 - Boting Yang, Cao An Wang:
Minimal Tetrahedralizations of a Class of Polyhedra. 241-265 - Etienne de Klerk, Dmitrii V. Pasechnik, Joost P. Warners:
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function. 267-294 - Gerard J. Chang, Chiuyuan Chen, Yaping Chen:
Vertex and Tree Arboricities of Graphs. 295-306 - Alexander A. Ageev, Maxim Sviridenko:
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee. 307-328 - Clemens Heuberger:
Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results. 329-361 - Andrea Lodi, Silvano Martello, Daniele Vigo:
Models and Bounds for Two-Dimensional Level Packing Problems. 363-379 - Elena Fernández, Oscar Meza:
Even Cycles and Perfect Matching Problems with Side Constraints. 381-396
Volume 8, Number 4, December 2004
- Jinbo Xu, Ming Li, Ying Xu:
Protein Threading by Linear Programming: Theoretical Analysis and Computational Results. 403-418 - Valmir Carneiro Barbosa, Luciana C. D. Campos:
A Novel Evolutionary Formulation of the Maximum Independent Set Problem. 419-437 - Toshihiro Fujito:
On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover. 439-452 - Shyong Jian Shyu, Yin-Te Tsai, Richard C. T. Lee:
The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction. 453-468 - Frédéric Roupin:
From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems. 469-493 - Oleg A. Prokopyev, Panos M. Pardalos:
Minimum elsilon-equivalent Circuit Size Problem. 495-502
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.
last updated on 2024-11-19 20:35 CET 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:
