Krzysztof Fleszar

发表

An evolutionary algorithm for resource-constrained project scheduling

Krzysztof Fleszar, Khalil S. Hindi, Hongbo Yang, 2002, IEEE Trans. Evol. Comput..

A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times

Krzysztof Fleszar, Khalil S. Hindi, Christoforos Charalambous, 2012, J. Intell. Manuf..

A PTAS for Euclidean TSP with Hyperplane Neighborhoods

Ruben Hoeksma, Kevin Schewior, Antonios Antoniadis, 2020, ACM Trans. Algorithms.

ON GENERALIZED OWA APPROACH TO SUPPORT LOCATION AND ROUTING DECISIONS

M. Kubiak, A. Jaszkiewicz, W. Ogryczak, 2022 .

The Complexity of Drawing Graphs on Few Lines and Few Planes

Steven Chaplick, Fabian Lipp, A. Wolff, 2017, WADS.

Generalized Minimum Manhattan Networks

Krzysztof Fleszar, A. Wolff, 2012 .

Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours

Krzysztof Fleszar, François Dross, Anna Zych-Pawlewicz, 2022, ArXiv.

A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem

Krzysztof Fleszar, Khalil S. Hindi, K. Hindi, 2004, Comput. Ind. Eng..

The Complexity of Drawing Graphs on Few Lines and Few Planes

Alexander Wolff, Oleg Verbitsky, Steven Chaplick, 2016, WADS.

Algorithms for the unrelated parallel machine scheduling problem with a resource constraint

Krzysztof Fleszar, Khalil S. Hindi, K. Hindi, 2018, Eur. J. Oper. Res..

New heuristics for one-dimensional bin-packing

Krzysztof Fleszar, Khalil S. Hindi, K. Hindi, 2002, Comput. Oper. Res..

Solving the resource-constrained project scheduling problem by a variable neighbourhood search

Krzysztof Fleszar, Khalil S. Hindi, K. Hindi, 2004, Eur. J. Oper. Res..

A branch-and-bound algorithm for the quadratic multiple knapsack problem

Krzysztof Fleszar, Krzysztof Fleszar, 2021, Eur. J. Oper. Res..

A Hybrid Searching Method for the Unrelated Parallel Machine Scheduling Problem

Krzysztof Fleszar, Khalil S. Hindi, Christoforos Charalambous, 2010, AIAI.

Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem

Krzysztof Fleszar, Khalil S. Hindi, K. Hindi, 2009, Comput. Oper. Res..

New algorithms for maximum disjoint paths based on tree-likeness

Matthias Mnich, Joachim Spoerhase, Krzysztof Fleszar, 2016, Mathematical Programming.

Colored Non-crossing Euclidean Steiner Forest

Alexander Wolff, Sergey Bereg, Philipp Kindermann, 2015, ISAAC.

The Complexity of Drawing Graphs on Few Lines and Few Planes

Fabian Lipp, A. Wolff, O. Verbitsky, 2016, WADS.

An effective VNS for the capacitated p-median problem

Krzysztof Fleszar, Khalil S. Hindi, K. Hindi, 2008, Eur. J. Oper. Res..

A variable neighbourhood search algorithm for the open vehicle routing problem

Krzysztof Fleszar, Khalil S. Hindi, Ibrahim H. Osman, 2009, Eur. J. Oper. Res..

An enumerative heuristic and reduction methods for the assembly line balancing problem

Krzysztof Fleszar, Khalil S. Hindi, K. Hindi, 2003, Eur. J. Oper. Res..

Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem

Krzysztof Fleszar, Christoforos Charalambous, Krzysztof Fleszar, 2011, Eur. J. Oper. Res..

An effective heuristic for the CLSP with set-up times

Krzysztof Fleszar, Khalil S. Hindi, Christoforos Charalambous, 2003, J. Oper. Res. Soc..

Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts

Krzysztof Fleszar, Krzysztof Fleszar, 2013, Comput. Oper. Res..

A PTAS for Euclidean TSP with Hyperplane Neighborhoods

Ruben Hoeksma, Kevin Schewior, Antonios Antoniadis, 2018, SODA.

Hybrid of the weighted minimum slack and shortest processing time dispatching rules for the total weighted tardiness single machine scheduling problem with availability constraints

Krzysztof Fleszar, Ibrahim H. Osman, Hocine Belouadah, 2009 .

Solving the resource-constrained project scheduling problem by a variable neighbourhood search

K. Hindi, Krzysztof Fleszar, 2004, European Journal of Operational Research.

A MILP model and two heuristics for the Bin Packing Problem with Conflicts and Item Fragmentation

Krzysztof Fleszar, 2022, Eur. J. Oper. Res..

Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems

Jaroslaw Byrka, Joachim Spoerhase, Bartosz Rybicki, 2013, SODA.

Network-Design Problems in Graphs and on the Plane

Krzysztof Fleszar, Krzysztof Fleszar, 2018 .