default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuigi Moccia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j14]Luigi Moccia
, Duncan W. Allen, Gilbert Laporte, Andrea Spinosa:
Mode boundaries of automated metro and semi-rapid rail in urban transit. Public Transp. 14(3): 739-802 (2022)- 2020
- [j13]Luigi Moccia, Duncan W. Allen, Gilbert Laporte:
A spatially disaggregated model for the technology selection and design of a transit line. Public Transp. 12(3): 647-691 (2020)
2010 – 2019
- 2018
- [j12]Luigi Moccia, Duncan W. Allen, Eric C. Bruun:
A technology selection and design model of a semi-rapid transit line. Public Transp. 10(3): 455-497 (2018) - 2017
- [j11]Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov, Luigi Moccia:
Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile. Comput. Oper. Res. 78: 27-43 (2017) - 2015
- [c2]Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov, Luigi Moccia:
A Mixed Integer Linear Program for the Rapid Transit Network Design Problem with Static Modal Competition (Short Paper). ATMOS 2015: 95-96 - 2013
- [j10]Luigi Moccia:
Operational Research in the Wine Supply Chain. INFOR Inf. Syst. Oper. Res. 51(2): 53-63 (2013) - [j9]Antonella Guzzo, Luigi Moccia, Domenico Saccà, Edoardo Serra:
Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs. ACM Trans. Knowl. Discov. Data 7(4): 18:1-18:39 (2013) - 2012
- [j8]Luigi Moccia, Jean-François Cordeau, Gilbert Laporte:
An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. J. Oper. Res. Soc. 63(2): 232-244 (2012) - 2011
- [j7]Jean-François Cordeau, Gilbert Laporte, Luigi Moccia, Gregorio Sorrentino:
Optimizing yard assignment in an automotive transshipment terminal. Eur. J. Oper. Res. 215(1): 149-160 (2011) - [j6]Luigi Moccia, Jean-François Cordeau, Gilbert Laporte, Stefan Ropke, Maria Pia Valentini:
Modeling and solving a multimodal transportation problem with flexible-time and scheduled services. Networks 57(1): 53-68 (2011) - [c1]Antonella Guzzo, Luigi Moccia, Domenico Saccà, Edoardo Serra:
A Decomposition Technique for the Inverse Frequent Itemset Mining Problem. SEBD 2011: 66-75
2000 – 2009
- 2009
- [j5]Luigi Moccia, Jean-François Cordeau, Maria Flavia Monaco, Marcello Sammarra:
A column generation heuristic for a dynamic generalized assignment problem. Comput. Oper. Res. 36(9): 2670-2681 (2009) - 2008
- [j4]Maria Flavia Monaco, Marcello Sammarra, Luigi Moccia:
Some observations about the extreme points of the Generalized Cardinality-Constrained Shortest Path Problem polytope. Optim. Lett. 2(4): 577-585 (2008) - 2007
- [j3]Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia:
The service allocation problem at the Gioia Tauro Maritime Terminal. Eur. J. Oper. Res. 176(2): 1167-1184 (2007) - 2006
- [j2]Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia:
A Memetic Heuristic for the Generalized Quadratic Assignment Problem. INFORMS J. Comput. 18(4): 433-443 (2006) - 2005
- [j1]Jean-François Cordeau, Gilbert Laporte, Pasquale Legato, Luigi Moccia:
Models and Tabu Search Heuristics for the Berth-Allocation Problem. Transp. Sci. 39(4): 526-538 (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 2024-10-07 21:20 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:
