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...

Measurements of the growth and coagulation of soot particles in a high-pressure shock tube

Combustion and flame, 2000, Vol.120 (1), p.188-199

2000

Volltextzugriff (PDF)

Scheduling problems for parallel dedicated machines under multiple resource constraints

Discrete Applied Mathematics, 2003-11, Vol.133 (1), p.45-68

2003

Volltextzugriff (PDF)

Scheduling parallel dedicated machines under a single non-shared resource

European journal of operational research, 2003-06, Vol.147 (2), p.345-364

2003

Volltextzugriff (PDF)

Operator non-availability periods

4OR, 2009-10, Vol.7 (3), p.239-253

2009

Volltextzugriff (PDF)

Soot Formation in a Shock Tube under Elevated Pressure Conditions

Combustion science and technology, 1996-03, Vol.113 (1), p.67-80

1996

Volltextzugriff (PDF)

Approximation algorithms for knapsack problems with cardinality constraints

European journal of operational research, 2000-06, Vol.123 (2), p.333-345

2000

Volltextzugriff (PDF)

Optimization of cardinality constrained portfolios with a hybrid local search algorithm

OR Spectrum, 2003-11, Vol.25 (4), p.481-495

2003

Volltextzugriff (PDF)

Approximating Multiobjective Knapsack Problems

Management science, 2002-12, Vol.48 (12), p.1603-1612

2002

Volltextzugriff (PDF)

An efficient fully polynomial approximation scheme for the Subset-Sum Problem

Journal of computer and system sciences, 2003-03, Vol.66 (2), p.349-370

2003

Volltextzugriff (PDF)

Algorithms for on-line bin-packing problems with cardinality constraints

Discrete Applied Mathematics, 2004-09, Vol.143 (1), p.238-251

2004

Volltextzugriff (PDF)

Improved dynamic programming in connection with an FPTAS for the knapsack problem

Journal of combinatorial optimization, 2004-03, Vol.8 (1), p.5-11

2004

Volltextzugriff (PDF)

Semi-on-line multiprocessor scheduling with given total processing time

Theoretical computer science, 2005-06, Vol.337 (1), p.134-146

2005

Volltextzugriff (PDF)

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

Lecture notes in computer science, 1999, p.51-62

1999

Volltextzugriff (PDF)

Selecting portfolios with fixed costs and minimum transaction lots

Annals of operations research, 2000-01, Vol.99 (1), p.287

2000

Volltextzugriff (PDF)

Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm

Computing, 1991-09, Vol.46 (3), p.183-191

KELLERER, H

1991

Volltextzugriff (PDF)

An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing

Operations research letters, 2003, Vol.31 (1), p.35-41

2003

Volltextzugriff (PDF)

Knapsack Problems

1, 2003

Volltextzugriff (PDF)

Data Presentation

2019

Volltextzugriff (PDF)

Approximation schemes for ordered vector packing problems

Naval research logistics, 2003-02, Vol.50 (1), p.58-69

2003

Volltextzugriff (PDF)

A new fully polynomial time approximation scheme for the knapsack problem

Journal of combinatorial optimization, 1999-07, Vol.3 (1), p.59-71

1999

Volltextzugriff (PDF)

The Multiple Subset Sum Problem

SIAM journal on optimization, 2000, Vol.11 (2), p.308-319

2000

Volltextzugriff (PDF)

Semi on-line algorithms for the partition problem

Operations research letters, 1997, Vol.21 (5), p.235-242

1997

Volltextzugriff (PDF)

Cardinality constrained bin-packing problems

Annals of operations research, 1999-01, Vol.92, p.335

1999

Volltextzugriff (PDF)

A new fully polynomial approximation scheme for the knapsack problem

Approximation Algorithms for Combinatiorial Optimization, 2006, p.123-134

2006

Volltextzugriff (PDF)

A linear compound algorithm for uniform machine scheduling

Computing, 1998-01, Vol.61 (1), p.1-9

1998

Volltextzugriff (PDF)

1 – 25 von 512

Menü

Weitere Dienste

Einstellungen

Measurements of the growth and coagulation of soot particles in a high-pressure shock tube

Scheduling problems for parallel dedicated machines under multiple resource constraints

Scheduling parallel dedicated machines under a single non-shared resource

Operator non-availability periods

Soot Formation in a Shock Tube under Elevated Pressure Conditions

Approximation algorithms for knapsack problems with cardinality constraints

Optimization of cardinality constrained portfolios with a hybrid local search algorithm

Approximating Multiobjective Knapsack Problems

An efficient fully polynomial approximation scheme for the Subset-Sum Problem

Algorithms for on-line bin-packing problems with cardinality constraints

Improved dynamic programming in connection with an FPTAS for the knapsack problem

Semi-on-line multiprocessor scheduling with given total processing time

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

Selecting portfolios with fixed costs and minimum transaction lots

Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm

An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing

Knapsack Problems

Data Presentation

Approximation schemes for ordered vector packing problems

A new fully polynomial time approximation scheme for the knapsack problem

The Multiple Subset Sum Problem

Semi on-line algorithms for the partition problem

Cardinality constrained bin-packing problems

A new fully polynomial approximation scheme for the knapsack problem

A linear compound algorithm for uniform machine scheduling

Suchergebnisse filtern