default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilco van den Heuvel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Nabil Absi
, Wilco van den Heuvel, Stéphane Dauzère-Pérès:
Complexity analysis of integrated dynamic lot sizing and maintenance planning problems. Eur. J. Oper. Res. 318(1): 100-109 (2024)- 2023
- [j29]Rick S. H. Willemsen, Wilco van den Heuvel, Michel van de Velden:
A new mixed integer programming approach for inverse correspondence analysis. Comput. Oper. Res. 160: 106375 (2023) - [j28]Mehmet Önal, Wilco van den Heuvel, Meryem Merve Dereli, Erinç Albey:
Economic lot sizing problem with tank scheduling. Eur. J. Oper. Res. 308(1): 166-182 (2023) - [j27]Marcel Turkensteen, Wilco van den Heuvel:
The trade-off between costs and carbon emissions from economic lot-sizing decisions. INFOR Inf. Syst. Oper. Res. 61(2): 169-198 (2023) - [j26]Wilco van den Heuvel, Semra Agrali, Z. Caner Taskin:
A Decomposition Algorithm for Single and Multiobjective Integrated Market Selection and Production Planning. INFORMS J. Comput. 35(6): 1439-1453 (2023) - [j25]Hark-Chin Hwang, Wilco van den Heuvel, Albert P. M. Wagelmans:
Multilevel Lot-Sizing with Inventory Bounds. INFORMS J. Comput. 35(6): 1470-1490 (2023) - 2022
- [j24]Ashwin Arulselvan, Kerem Akartunali, Wilco van den Heuvel:
Economic lot-sizing problem with remanufacturing option: complexity and algorithms. Optim. Lett. 16(2): 421-432 (2022) - 2021
- [j23]Elodie Suzanne, Nabil Absi, Valeria Borodin, Wilco van den Heuvel:
Lot-sizing for industrial symbiosis. Comput. Ind. Eng. 160: 107464 (2021) - [j22]Mathijs van Zon, Remy Spliet, Wilco van den Heuvel:
The Joint Network Vehicle Routing Game. Transp. Sci. 55(1): 179-195 (2021) - 2020
- [j21]Michel van de Velden, Wilco van den Heuvel, Hugo Galy, Patrick J. F. Groenen:
Retrieving a contingency table from a correspondence analysis solution. Eur. J. Oper. Res. 283(2): 541-548 (2020) - [j20]Elodie Suzanne, Nabil Absi, Valeria Borodin, Wilco van den Heuvel:
A single-item lot-sizing problem with a by-product and inventory capacities. Eur. J. Oper. Res. 287(3): 844-855 (2020)
2010 – 2019
- 2019
- [j19]R. B. O. Kerkkamp, Wilco van den Heuvel, Albert P. M. Wagelmans:
Robust pooling for contracting models with asymmetric information. Eur. J. Oper. Res. 273(3): 1036-1051 (2019) - [j18]Zahra Mobini, Wilco van den Heuvel, Albert P. M. Wagelmans:
Designing multi-period supply contracts in a two-echelon supply chain with asymmetric information. Eur. J. Oper. Res. 277(2): 542-560 (2019) - [j17]Nabil Absi, Wilco van den Heuvel:
Worst case analysis of Relax and Fix heuristics for lot-sizing problems. Eur. J. Oper. Res. 279(2): 449-458 (2019) - [j16]Onur A. Kilic, Wilco van den Heuvel:
Economic lot sizing with remanufacturing: Structural properties and polynomial-time heuristics. IISE Trans. 51(12): 1318-1331 (2019) - 2017
- [j15]Thomas Breugem, Twan Dollevoet, Wilco van den Heuvel:
Analysis of FPTASes for the multi-objective shortest path problem. Comput. Oper. Res. 78: 44-58 (2017) - [j14]Wilco van den Heuvel, Albert P. M. Wagelmans:
A note on "A multi-period profit maximizing model for retail supply chain management". Eur. J. Oper. Res. 260(2): 625-630 (2017) - 2016
- [j13]Joseph Geunes, H. Edwin Romeijn, Wilco van den Heuvel:
Improving the efficiency of decentralized supply chains with fixed ordering costs. Eur. J. Oper. Res. 252(3): 815-828 (2016) - 2015
- [j12]Mathijn J. Retel Helmrich, Raf Jans, Wilco van den Heuvel, Albert P. M. Wagelmans:
The economic lot-sizing problem with an emission capacity constraint. Eur. J. Oper. Res. 241(1): 50-62 (2015) - [j11]Mehmet Önal, H. Edwin Romeijn, Amar Sapra, Wilco van den Heuvel:
The economic lot-sizing problem with perishable items and consumption order preference. Eur. J. Oper. Res. 244(3): 881-891 (2015) - 2012
- [j10]Mehmet Önal, Wilco van den Heuvel, Tieming Liu:
A note on "The economic lot sizing problem with inventory bounds". Eur. J. Oper. Res. 223(1): 290-294 (2012) - [j9]Wilco van den Heuvel, O. Erhun Kundakcioglu, Joseph Geunes, H. Edwin Romeijn, Thomas C. Sharkey, Albert P. M. Wagelmans:
Integrated market selection and production planning: complexity and solution approaches. Math. Program. 134(2): 395-424 (2012) - 2011
- [j8]Wilco van den Heuvel, José Miguel Gutiérrez, Hark-Chin Hwang:
Note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities". Eur. J. Oper. Res. 213(2): 455-457 (2011) - 2010
- [j7]Wilco van den Heuvel, Albert P. M. Wagelmans:
Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics. Oper. Res. 58(1): 59-67 (2010)
2000 – 2009
- 2009
- [j6]Wilco van den Heuvel, Albert P. M. Wagelmans:
A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters. Oper. Res. Lett. 37(2): 102-106 (2009) - 2008
- [j5]Wilco van den Heuvel, Albert P. M. Wagelmans:
Four equivalent lot-sizing models. Oper. Res. Lett. 36(4): 465-470 (2008) - 2007
- [j4]Wilco van den Heuvel, Peter Borm, Herbert Hamers:
Economic lot-sizing games. Eur. J. Oper. Res. 176(2): 1117-1130 (2007) - 2006
- [j3]Wilco van den Heuvel, Albert P. M. Wagelmans:
An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem. Comput. Oper. Res. 33(12): 3583-3599 (2006) - [j2]Wilco van den Heuvel, Albert P. M. Wagelmans:
A polynomial time algorithm for a deterministic joint pricing and inventory model. Eur. J. Oper. Res. 170(2): 463-480 (2006) - 2005
- [j1]Wilco van den Heuvel, Albert P. M. Wagelmans:
A comparison of methods for lot-sizing in a rolling horizon environment. Oper. Res. Lett. 33(5): 486-496 (2005)
Coauthor Index
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 2025-01-20 23:03 CET 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:
