default search action
Krzysztof Fleszar 0002
Person information
- affiliation: American University of Beirut, Lebanon
Other persons with the same name
- Krzysztof Fleszar 0001
— University of Warsaw, Poland (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j20]Krzysztof Fleszar
A new MILP model and fast heuristics for the variable-sized bin packing problem with time windows. Comput. Ind. Eng. 175: 108849 (2023) - 2022
- [j19]Krzysztof Fleszar
A branch-and-bound algorithm for the quadratic multiple knapsack problem. Eur. J. Oper. Res. 298(1): 89-98 (2022) - [j18]Krzysztof Fleszar
A MILP model and two heuristics for the Bin Packing Problem with Conflicts and Item Fragmentation. Eur. J. Oper. Res. 303(1): 37-53 (2022)
2010 – 2019
- 2018
- [j17]Krzysztof Fleszar
Algorithms for the unrelated parallel machine scheduling problem with a resource constraint. Eur. J. Oper. Res. 271(3): 839-848 (2018) - 2017
- [j16]Krzysztof Fleszar
A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2). Eur. J. Oper. Res. 259(1): 169-174 (2017) - 2016
- [j15]Krzysztof Fleszar:
An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem. INFORMS J. Comput. 28(4): 703-720 (2016) - 2013
- [j14]Krzysztof Fleszar
Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts. Comput. Oper. Res. 40(1): 463-474 (2013) - 2012
- [j13]Christoforos Charalambous
Variable Neighborhood Descent for the Unrelated Parallel Machine Scheduling Problem. Int. J. Artif. Intell. Tools 21(4) (2012) - [j12]Krzysztof Fleszar
A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times. J. Intell. Manuf. 23(5): 1949-1958 (2012) - 2011
- [j11]Christoforos Charalambous
A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts. Comput. Oper. Res. 38(10): 1443-1451 (2011) - [j10]Krzysztof Fleszar
Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem. Eur. J. Oper. Res. 210(2): 176-184 (2011) - 2010
- [c1]Christoforos Charalambous, Krzysztof Fleszar, Khalil S. Hindi:
A Hybrid Searching Method for the Unrelated Parallel Machine Scheduling Problem. AIAI 2010: 230-237
2000 – 2009
- 2009
- [j9]Krzysztof Fleszar
Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem. Comput. Oper. Res. 36(5): 1602-1607 (2009) - [j8]Krzysztof Fleszar
A variable neighbourhood search algorithm for the open vehicle routing problem. Eur. J. Oper. Res. 195(3): 803-809 (2009) - 2008
- [j7]Krzysztof Fleszar
An effective VNS for the capacitated p-median problem. Eur. J. Oper. Res. 191(3): 612-622 (2008) - 2004
- [j6]Khalil S. Hindi, Krzysztof Fleszar
A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem. Comput. Ind. Eng. 47(1): 91-101 (2004) - [j5]Krzysztof Fleszar
Solving the resource-constrained project scheduling problem by a variable neighbourhood search. Eur. J. Oper. Res. 155(2): 402-413 (2004) - 2003
- [j4]Krzysztof Fleszar
An enumerative heuristic and reduction methods for the assembly line balancing problem. Eur. J. Oper. Res. 145(3): 606-620 (2003) - [j3]Khalil S. Hindi, Krzysztof Fleszar
An effective heuristic for the CLSP with set-up times. J. Oper. Res. Soc. 54(5): 490-498 (2003) - 2002
- [j2]Krzysztof Fleszar
New heuristics for one-dimensional bin-packing. Comput. Oper. Res. 29(7): 821-839 (2002) - [j1]Khalil S. Hindi, Hongbo Yang, Krzysztof Fleszar
An evolutionary algorithm for resource-constrained project scheduling. IEEE Trans. Evol. Comput. 6(5): 512-518 (2002)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: