default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJose L. Walteros
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Demetrios V. Papazaharias
, Jose L. Walteros:
Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations. Math. Program. Comput. 15(1): 103-151 (2023)- 2022
- [j17]Rishabh Bhandawat, Sabrina Casucci, Bina Ramamurthy, Jose L. Walteros:
Cooperative Blood Inventory Ledger (CoBIL): A decentralized decision-making framework for improving blood product management. Comput. Ind. Eng. 172(Part): 108571 (2022) - [j16]Ningji Wei, Jose L. Walteros:
Integer programming methods for solving binary interdiction games. Eur. J. Oper. Res. 302(2): 456-469 (2022) - [j15]Mohammad Javad Naderi, Austin Buchanan, Jose L. Walteros:
Worst-case analysis of clique MIPs. Math. Program. 195(1): 517-551 (2022) - 2021
- [j14]Ningji Wei, Jose L. Walteros, Foad Mahdavi Pajouh:
Integer Programming Formulations for Minimum Spanning Tree Interdiction. INFORMS J. Comput. 33(4): 1461-1480 (2021) - [j13]Ningji Wei, Jose L. Walteros, McKenzie R. Worden, Héctor J. Ortiz-Peña:
A resiliency analysis of information distribution policies over mobile ad hoc networks. Optim. Lett. 15(4): 1081-1103 (2021) - 2020
- [j12]Yan Cheng Hsu, Jose L. Walteros, Rajan Batta:
Solving the petroleum replenishment and routing problem with variable demands and time windows. Ann. Oper. Res. 294(1): 9-46 (2020) - [j11]María Nariné Torres, John E. Fontecha, Zhenduo Zhu, Jose L. Walteros, Juan Pablo Rodríguez:
A participatory approach based on stochastic optimization for the spatial allocation of Sustainable Urban Drainage Systems for rainwater harvesting. Environ. Model. Softw. 123 (2020) - [j10]Jose L. Walteros, Austin Buchanan:
Why Is Maximum Clique Often Easy in Practice? Oper. Res. 68(6): 1866-1895 (2020) - [j9]Ningji Wei, Jose L. Walteros, Rajan Batta:
On the distance between random events on a network. Networks 75(2): 203-231 (2020)
2010 – 2019
- 2019
- [j8]Jose L. Walteros, Alexander Veremyev, Panos M. Pardalos, Eduardo L. Pasiliao:
Detecting critical node structures on graphs: A mathematical programming approach. Networks 73(1): 48-88 (2019) - 2018
- [j7]Chrysafis Vogiatzis, Jose L. Walteros:
Integer programming models for detecting graph bipartitions with structural requirements. Networks 71(4): 432-450 (2018) - 2016
- [j6]Panos M. Pardalos, Chrysafis Vogiatzis, Jose L. Walteros:
Guest editorial: revised selected papers from the LION 8 conference. Ann. Math. Artif. Intell. 76(1-2): 1-3 (2016) - 2015
- [j5]Foad Mahdavi Pajouh, Jose L. Walteros, Vladimir Boginski, Eduardo L. Pasiliao:
Minimum edge blocker dominating set problem. Eur. J. Oper. Res. 247(1): 16-26 (2015) - [j4]Jose L. Walteros, Andrés L. Medaglia, Germán Riaño:
Hybrid Algorithm for Route Design on Bus Rapid Transit Systems. Transp. Sci. 49(1): 66-84 (2015) - 2014
- [j3]Jose L. Walteros, Chrysafis Vogiatzis, Eduardo L. Pasiliao, Panos M. Pardalos:
Integer programming models for the multidimensional assignment problem with star costs. Eur. J. Oper. Res. 235(3): 553-568 (2014) - [j2]Austin Buchanan, Jose L. Walteros, Sergiy Butenko, Panos M. Pardalos:
Solving maximum clique in sparse graphs: an O(nm+n2d/4 algorithm for d-degenerate graphs. Optim. Lett. 8(5): 1611-1617 (2014) - [e1]Panos M. Pardalos, Mauricio G. C. Resende, Chrysafis Vogiatzis, Jose L. Walteros:
Learning and Intelligent Optimization - 8th International Conference, Lion 8, Gainesville, FL, USA, February 16-21, 2014. Revised Selected Papers. Lecture Notes in Computer Science 8426, Springer 2014, ISBN 978-3-319-09583-7 [contents] - 2012
- [c1]Jose L. Walteros, Panos M. Pardalos:
A Decomposition Approach for Solving Critical Clique Detection Problems. SEA 2012: 393-404 - 2010
- [j1]Dominique Feillet, Michel Gendreau, Andrés L. Medaglia, Jose L. Walteros:
A note on branch-and-cut-and-price. Oper. Res. Lett. 38(5): 346-353 (2010)
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-04-24 22:52 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:
