Krzysztof Fleszar - Citegraph

Author Info

Name	Affiliation	Papers
KRZYSZTOF FLESZAR	Olayan School of Business, American University of Beirut (AUB), P.O. Box 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon	30
Collaborators	Citations	PageRank
28	368	25.38
Referers	Referees	References
847	526	322

Search Limit

100847

Publications (30 rows)

Collaborators (28 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
A PTAS for Euclidean TSP with Hyperplane Neighborhoods	0	0.34	2020
A PTAS for Euclidean TSP with Hyperplane Neighborhoods.	0	0.34	2019
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity.	0	0.34	2018
Approximating the Generalized Minimum Manhattan Network Problem.	0	0.34	2018
Algorithms for the unrelated parallel machine scheduling problem with a resource constraint.	6	0.40	2018
A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2).	2	0.36	2017
The Complexity of Drawing Graphs on Few Lines and Few Planes.	4	0.44	2017
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness.	1	0.36	2016
Drawing Graphs On Few Lines And Few Planes	4	0.46	2016
An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem.	3	0.41	2016
Bi-factor approximation algorithms for hard capacitated k-median problems	1	0.35	2015
Colored Non-Crossing Euclidean Steiner Forest.	2	0.46	2015
Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts	12	0.59	2013
A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median.	1	0.36	2013
Variable Neighborhood Descent For The Unrelated Parallel Machine Scheduling Problem	0	0.34	2012
A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times	7	0.56	2012
Structural complexity of multiobjective NP search problems	0	0.34	2012
Polylogarithmic Approximation for Generalized Minimum Manhattan Networks	0	0.34	2012
The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions	2	0.42	2011
A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts	15	0.71	2011
Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem	13	0.58	2011
A Hybrid Searching Method For The Unrelated Parallel Machine Scheduling Problem	0	0.34	2010
Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem	17	0.75	2009
A variable neighbourhood search algorithm for the open vehicle routing problem	64	1.97	2009
An effective VNS for the capacitated p-median problem	27	1.15	2008
Solving the resource-constrained project scheduling problem by a variable neighbourhood search	51	3.05	2004
A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem	9	0.60	2004
An enumerative heuristic and reduction methods for the assembly line balancing problem	33	3.24	2003
New heuristics for one-dimensional bin-packing	61	3.32	2002
An evolutionary algorithm for resource-constrained project scheduling.	33	2.13	2002