UB Paderborn / Katalog / Suche / in CDI

Efficient implementations of construction heuristics for the rectilinear block packing problem

Computers & operations research, 2015-01, Vol.53, p.206-222

2015

Volltextzugriff (PDF)

An Iterated Local Search Algorithm for Commuting Bus Routing Problem with Latest Arrival Time Constraint

2022 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), 2022, p.0791-0795

2022

Volltextzugriff (PDF)

Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints

Transportation science, 2005-05, Vol.39 (2), p.206-232

2005

Volltextzugriff (PDF)

Improved local search algorithms for the rectangle packing problem with general spatial costs

European journal of operational research, 2005-11, Vol.167 (1), p.48-67

2005

Volltextzugriff (PDF)

Fast algorithms to enumerate all common intervals of two permutations

Algorithmica, 2000-02, Vol.26 (2), p.290-309

2000

Volltextzugriff (PDF)

Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation

Journal of heuristics, 2001-09, Vol.7 (5), p.423

2001

Volltextzugriff (PDF)

Local search algorithms for the rectangle packing problem with general spatial costs

Mathematical programming, 2003-08, Vol.97 (3), p.543-569

2003

Volltextzugriff (PDF)

A path relinking approach with ejection chains for the generalized assignment problem

European journal of operational research, 2006-03, Vol.169 (2), p.548-569

2006

Volltextzugriff (PDF)

Worst case scenario lemma for Γ-robust combinatorial optimization problems under max-min criterion

2017 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), 2017, p.55-59

2017

Volltextzugriff (PDF)

A 3-flip neighborhood local search for the set covering problem

European journal of operational research, 2006-07, Vol.172 (2), p.472-499

2006

Volltextzugriff (PDF)

An Ejection Chain Approach for the Generalized Assignment Problem

INFORMS journal on computing, 2004-05, Vol.16 (2), p.133-151

2004

Volltextzugriff (PDF)

A variable depth search algorithm with branching search for the generalized assignment problem

Optimization methods & software, 1998-01, Vol.10 (2), p.419-441

1998

Volltextzugriff (PDF)

One-dimensional cutting stock problem to minimize the number of different patterns

European journal of operational research, 2003-04, Vol.146 (2), p.388-402

2003

Volltextzugriff (PDF)

An iterated dual substitution approach for the min-max regret multidimensional knapsack problem

2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), 2016, p.726-730

2016

Volltextzugriff (PDF)

Analyses on the 2 and 3-flip neighborhoods for the MAX SAT

Journal of combinatorial optimization, 1999-07, Vol.3 (1), p.95-114

1999

Volltextzugriff (PDF)

Algorithms for the min-max regret generalized assignment problem with interval data

2014 IEEE International Conference on Industrial Engineering and Engineering Management, 2014, p.734-738

2014

Volltextzugriff (PDF)

An efficient method for checking overlaps and construction algorithms for the bitmap shape packing problem

2014 IEEE International Conference on Industrial Engineering and Engineering Management, 2014, p.1056-1060

2014

Volltextzugriff (PDF)

A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns

IEICE Transactions on Information and Systems, 2008/03/01, Vol.E91.D(3), pp.781-788

2008

Volltextzugriff (PDF)

The use of dynamic programming in genetic algorithms for permutation problems

European journal of operational research, 1996-07, Vol.92 (2), p.387-401

1996

Volltextzugriff (PDF)

A decomposability index in logical analysis of data

Discrete Applied Mathematics, 2004-08, Vol.142 (1), p.165-180

2004

Volltextzugriff (PDF)

Finding Essential Attributes from Binary Data

Annals of mathematics and artificial intelligence, 2003-11, Vol.39 (3), p.223-257

2003

Volltextzugriff (PDF)

An Index for the Data Size to Extract Decomposable Structures in LAD

Algorithms and Computation, 2001, p.279-290

2001

Volltextzugriff (PDF)

Recent metaheuristic algorithms for the generalized assignment problem

International Conference on Informatics Research for Development of Knowledge Society Infrastructure, 2004. ICKS 2004, 2004, p.229-237

2004

Volltextzugriff (PDF)

On the complexity of deriving score functions from examples for problems in molecular biology

Automata, Languages and Programming, 1998, p.832-843

1998

Volltextzugriff (PDF)

Metaheuristics as robust and simple optimization tools

Proceedings of IEEE International Conference on Evolutionary Computation, 1996, p.541-546

1996

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Efficient implementations of construction heuristics for the rectilinear block packing problem

An Iterated Local Search Algorithm for Commuting Bus Routing Problem with Latest Arrival Time Constraint

Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints

Improved local search algorithms for the rectangle packing problem with general spatial costs

Fast algorithms to enumerate all common intervals of two permutations

Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation

Local search algorithms for the rectangle packing problem with general spatial costs

A path relinking approach with ejection chains for the generalized assignment problem

Worst case scenario lemma for Γ-robust combinatorial optimization problems under max-min criterion

A 3-flip neighborhood local search for the set covering problem

An Ejection Chain Approach for the Generalized Assignment Problem

A variable depth search algorithm with branching search for the generalized assignment problem

One-dimensional cutting stock problem to minimize the number of different patterns

An iterated dual substitution approach for the min-max regret multidimensional knapsack problem

Analyses on the 2 and 3-flip neighborhoods for the MAX SAT

Algorithms for the min-max regret generalized assignment problem with interval data

An efficient method for checking overlaps and construction algorithms for the bitmap shape packing problem

A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns

The use of dynamic programming in genetic algorithms for permutation problems

A decomposability index in logical analysis of data

Finding Essential Attributes from Binary Data

An Index for the Data Size to Extract Decomposable Structures in LAD

Recent metaheuristic algorithms for the generalized assignment problem

On the complexity of deriving score functions from examples for problems in molecular biology

Metaheuristics as robust and simple optimization tools

Suchergebnisse filtern