Krzysztof Fleszar

Available identifiers

zbMath Open fleszar.krzysztofMaRDI QIDQ238066

List of research outcomes

Publication	Date of Publication	Type
Gap-ETH-tight approximation schemes for red-green-blue separation and bicolored noncrossing Euclidean travelling salesman tours	2024-05-14	Paper
The Complexity of Drawing Graphs on Few Lines and Few Planes	2023-09-20	Paper
https://portal.mardi4nfdi.de/entity/Q5091054	2022-07-21	Paper
A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation	2022-06-10	Paper
A branch-and-bound algorithm for the quadratic multiple knapsack problem	2022-02-22	Paper
Minimum rectilinear polygons for given angle sequences	2021-12-15	Paper
A PTAS for Euclidean TSP with Hyperplane Neighborhoods	2021-05-03	Paper
Drawing graphs on few lines and few planes	2020-11-12	Paper
A PTAS for Euclidean TSP with Hyperplane Neighborhoods	2019-10-15	Paper
New algorithms for maximum disjoint paths based on tree-likeness	2018-09-28	Paper
Algorithms for the unrelated parallel machine scheduling problem with a resource constraint	2018-08-03	Paper
A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)	2018-05-25	Paper
Approximating the generalized minimum Manhattan network problem	2018-05-23	Paper
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness	2018-03-02	Paper
Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems	2017-10-05	Paper
The complexity of drawing graphs on few lines and few planes	2017-09-22	Paper
Drawing Graphs on Few Lines and Few Planes	2017-02-21	Paper
An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem	2017-02-08	Paper
Minimum Rectilinear Polygons for Given Angle Sequences	2017-02-01	Paper
Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts	2016-11-11	Paper
Colored Non-crossing Euclidean Steiner Forest	2016-01-11	Paper
Approximating the Generalized Minimum Manhattan Network Problem	2014-01-14	Paper
Structural Complexity of Multiobjective NP Search Problems	2012-06-29	Paper
Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem	2011-04-29	Paper
A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts	2011-03-25	Paper
A variable neighbourhood search algorithm for the open vehicle routing problem	2009-01-08	Paper
Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem	2008-12-17	Paper
An effective VNS for the capacitated \(p\)-median problem	2008-07-10	Paper
An effective heuristic for the CLSP with set-up times	2005-06-21	Paper
Solving the resource-constrained project scheduling problem by a variable neighbourhood search.	2004-03-14	Paper
An enumerative heuristic and reduction methods for the assembly line balancing problem	2003-04-10	Paper
New heuristics for one-dimensional bin-packing	2002-07-30	Paper

Research outcomes over time

This page was built for person: Krzysztof Fleszar