UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Polynomial time approximation algorithms for machine scheduling: ten open problems

Journal of scheduling, 1999-09, Vol.2 (5), p.203-213

1999

Volltextzugriff (PDF)

Performance Guarantees of Local Search for Multiprocessor Scheduling

INFORMS journal on computing, 2007, Vol.19 (1), p.52-63

2007

Volltextzugriff (PDF)

A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

Theoretical computer science, 2000-04, Vol.237 (1), p.105-122

2000

Volltextzugriff (PDF)

Performance guarantees of jump neighborhoods on restricted related parallel machines

Operations research letters, 2012-07, Vol.40 (4), p.287-291

2012

Volltextzugriff (PDF)

Scheduling of pipelined operator graphs

Journal of scheduling, 2012-06, Vol.15 (3), p.323-332

2012

Volltextzugriff (PDF)

Approximating schedules

Schuurman, Petra

2001

Volltextzugriff (PDF)

A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

Discrete optimization, 2007-06, Vol.4 (2), p.154-162

2007

Volltextzugriff (PDF)

A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays

Operations research letters, 1998-08, Vol.23 (1), p.9-11

Schuurman, Petra

1998

Volltextzugriff (PDF)

Recognizing DNA graphs is difficult

Discrete Applied Mathematics, 2003-04, Vol.127 (1), p.85-94

2003

Volltextzugriff (PDF)

Non-Approximability Results for Scheduling Problems with Minsum Criteria

INFORMS journal on computing, 2001-05, Vol.13 (2), p.157-168

2001

Volltextzugriff (PDF)

Recognizing DNA graphs is difficult: Computational molecular biology series. Issue IV

Discrete applied mathematics, 2003, Vol.127 (1), p.85-94

2003

Volltextzugriff (PDF)

A table of state complexity bounds for binary linear codes

IEEE transactions on information theory, 1996-11, Vol.42 (6), p.2034-2042

Schuurman, P.

1996

Volltextzugriff (PDF)

Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling

LATIN 2010: Theoretical Informatics, p.108-119

Volltextzugriff (PDF)

Approximation algorithms for the multiprocessor open shop scheduling problem

Operations research letters, 1999-05, Vol.24 (4), p.157-163

1999

Volltextzugriff (PDF)

Performance Guarantees of Local Search for Multiprocessor Scheduling

Integer Programming and Combinatorial Optimization, 2001, Vol.2081, p.370-382

2001

Volltextzugriff (PDF)

Approximating schedules

Schuurman, Petra

2001

Volltextzugriff (PDF)

DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem

Graph-Theoretic Concepts in Computer Science, 2002, Vol.2573, p.13-24

2002

Volltextzugriff (PDF)

A PTAS for single machine scheduling with controllable processing times

Acta cybernetica (Szeged), 2002-01, Vol.15 (3), p.369

2002

Volltextzugriff (PDF)

Non-approximability Results for Scheduling Problems with Minsum Criteria

Integer Programming and Combinatorial Optimization, p.353-366

Volltextzugriff (PDF)

De Bruijn graphs and DNA graphs (Extended abstract)

Lecture notes in computer science, 2001, p.296-305

2001

Volltextzugriff (PDF)

DNA sequencing, eulerian graphs

Lecture notes in computer science, 2002, p.13-24

2002

Volltextzugriff (PDF)

De Bruijn Graphs and DNA Graphs: Extended Abstract

Graph-Theoretic Concepts in Computer Science, 2001, p.296-305

2001

Volltextzugriff (PDF)

Preemptive scheduling with job-dependent setup times

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, 1999, p.759-767

1999

Volltextzugriff (PDF)

Scheduling a pipelined operator graph

Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, 2000, p.207-212

2000

Volltextzugriff (PDF)

1 – 25 von 45

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(39)
Mit Volltextzugriff
(42)

Publikationsform

Sprache

Englisch
(45)
Japanisch
(5)

Erscheinungsjahr

n.n

Zeitschrift / Serie

5 weitere anzeigen...

Weniger anzeigen...

Menü

Weitere Dienste

Einstellungen

Polynomial time approximation algorithms for machine scheduling: ten open problems

Performance Guarantees of Local Search for Multiprocessor Scheduling

A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

Performance guarantees of jump neighborhoods on restricted related parallel machines

Scheduling of pipelined operator graphs

Approximating schedules

A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays

Recognizing DNA graphs is difficult

Non-Approximability Results for Scheduling Problems with Minsum Criteria

Recognizing DNA graphs is difficult: Computational molecular biology series. Issue IV

A table of state complexity bounds for binary linear codes

Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling

Approximation algorithms for the multiprocessor open shop scheduling problem

Performance Guarantees of Local Search for Multiprocessor Scheduling

Approximating schedules

DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem

A PTAS for single machine scheduling with controllable processing times

Non-approximability Results for Scheduling Problems with Minsum Criteria

De Bruijn graphs and DNA graphs (Extended abstract)

DNA sequencing, eulerian graphs

De Bruijn Graphs and DNA Graphs: Extended Abstract

Preemptive scheduling with job-dependent setup times

Scheduling a pipelined operator graph

Optimising follow-up strategy based on cytology and human papillomavirus after fertility-sparing surgery for early stage cervical cancer: a nationwide, population-based, retrospective cohort study

Suchergebnisse filtern