default search action
Francisco Saldanha-da-Gama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j34]Antonio Diglio
, Stefan Nickel
Correction to: Towards a stochastic programming modeling framework for districting. Ann. Oper. Res. 332(1): 1241 (2024) - [j33]Bowen Zhang
Dealing with congestion in the optimization of locating single-server battery swapping stations. Inf. Sci. 666: 120426 (2024) - 2023
- [j32]Yuchen Li, Francisco Saldanha-da-Gama, Ming Liu, Zaoli Yang
A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem. Eur. J. Oper. Res. 304(1): 353-365 (2023) - [j31]Antonio Diglio
Approximation schemes for districting problems with probabilistic constraints. Eur. J. Oper. Res. 307(1): 233-248 (2023) - [j30]Víctor Blanco
Multi-type maximal covering location problems: Hybridizing discrete and continuous problems. Eur. J. Oper. Res. 307(3): 1040-1054 (2023) - [j29]Afaf Aloullal, Francisco Saldanha-da-Gama
Multi-period single-allocation hub location-routing: Models and heuristic solutions. Eur. J. Oper. Res. 310(1): 53-70 (2023) - [i1]Maria Albareda-Sambola, Elena Fernández, Francisco Saldanha-da-Gama
Outsourcing policies for the Facility Location Problem with Bernoulli Demand. CoRR abs/2310.18981 (2023) - 2022
- [j28]Yuchen Li, Zixiang Li
New approaches for rebalancing an assembly line with disruptions. Int. J. Comput. Integr. Manuf. 35(10-11): 1059-1076 (2022) - [j27]Tianqi Liu
Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution. INFORMS J. Comput. 34(5): 2776-2803 (2022) - [j26]Bowen Zhang, Xiang Li, Francisco Saldanha-da-Gama:
Free-floating bike-sharing systems: New repositioning rules, optimization models and solution algorithms. Inf. Sci. 600: 239-262 (2022) - 2020
- [j25]Antonio Diglio
Towards a stochastic programming modeling framework for districting. Ann. Oper. Res. 292(1): 249-285 (2020)
2010 – 2019
- 2019
- [j24]Pu Li
A Bi-Objective Capacitated Location-Routing Problem for Multiple Perishable Commodities. IEEE Access 7: 136729-136742 (2019) - [j23]Elena Fernández
New algorithmic framework for conditional value at risk: Application to stochastic fixed-charge transportation. Eur. J. Oper. Res. 277(1): 215-226 (2019) - [j22]Bernardo F. Almeida
Modeling frameworks for the multi-skill resource-constrained project scheduling problem: a theoretical and empirical comparison. Int. Trans. Oper. Res. 26(3): 946-967 (2019) - [j21]Juanjo Peiró
Heuristic Solutions for a Class of Stochastic Uncapacitated p-Hub Median Problems. Transp. Sci. 53(4): 1126-1149 (2019) - 2018
- [j20]Fabian Dunke, Iris Heckmann, Stefan Nickel
Time traps in supply chains: Is optimal still good enough? Eur. J. Oper. Res. 264(3): 813-829 (2018) - [j19]Alfredo Marín
Multi-period stochastic covering location problems: Modeling framework and solution approach. Eur. J. Oper. Res. 268(2): 432-449 (2018) - [j18]Ömer Burak Kinay, Bahar Yetis Kara
Modeling the shelter site location problem using chance constraints: A case study for Istanbul. Eur. J. Oper. Res. 270(1): 132-145 (2018) - 2017
- [j17]Maria Albareda-Sambola
Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands. INFORMS J. Comput. 29(4): 737-753 (2017) - [j16]Jordi Castro
A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method. Math. Program. 163(1-2): 411-444 (2017) - 2016
- [j15]Sibel A. Alumur
Multi-period hub network design problems with modular capacities. Ann. Oper. Res. 246(1-2): 289-312 (2016) - [j14]Bernardo F. Almeida
Priority-based heuristics for the multi-skill resource constrained project scheduling problem. Expert Syst. Appl. 57: 91-103 (2016) - 2015
- [j13]Isabel Correia
A note on "branch-and-price approach for the multi-skill project scheduling problem". Optim. Lett. 9(6): 1255-1258 (2015) - 2014
- [j12]Isabel Correia
The impact of fixed and variable costs in a multi-skill project scheduling problem: An empirical study. Comput. Ind. Eng. 72: 230-238 (2014) - 2013
- [j11]Isabel Correia
Comparing classical performance measures for a multi-period, two-echelon supply chain network design problem with sizing decisions. Comput. Ind. Eng. 64(1): 366-380 (2013) - 2012
- [j10]Joaquim A. S. Gromicho, Jelke J. van Hoorn
Solving the job-shop scheduling problem optimally by dynamic programming. Comput. Oper. Res. 39(12): 2968-2977 (2012) - [j9]Sibel A. Alumur
Multi-period reverse logistics network design. Eur. J. Oper. Res. 220(1): 67-78 (2012) - [j8]Isabel Correia
Project scheduling with flexible resources: formulation and inequalities. OR Spectr. 34(3): 635-663 (2012) - 2010
- [j7]Isabel Correia
Discretized formulations for capacitated location problems with modular distribution costs. Eur. J. Oper. Res. 204(2): 237-244 (2010) - [j6]Isabel Correia
The capacitated single-allocation hub location problem revisited: A note on a classical formulation. Eur. J. Oper. Res. 207(1): 92-96 (2010)
2000 – 2009
- 2009
- [j5]M. Teresa Melo
Facility location and supply chain management - A review. Eur. J. Oper. Res. 196(2): 401-412 (2009) - [j4]Stefan Nickel, Francisco Saldanha-da-Gama
Logistics network design. OR Spectr. 31(3): 461-463 (2009) - 2008
- [j3]Isabel Correia
Solving the variable size bin packing problem with discretized formulations. Comput. Oper. Res. 35(6): 2103-2113 (2008) - 2006
- [j2]M. Teresa Melo
Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning. Comput. Oper. Res. 33: 181-208 (2006) - [j1]Luis Eduardo Neves Gouveia
On the capacitated concentrator location problem: a reformulation by discretization. Comput. Oper. Res. 33: 1242-1258 (2006)
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-11-04 20:39 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: