Jose L. Walteros

According to our database, Jose L. Walteros authored at least 19 papers between 2010 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations.

Demetrios V. Papazaharias, Jose L. Walteros

Math. Program. Comput., March, 2023

2022

Worst-case analysis of clique MIPs.

Mohammad Javad Naderi, Austin Buchanan, Jose L. Walteros

Math. Program., 2022

Integer programming methods for solving binary interdiction games.

Ningji Wei, Jose L. Walteros

Eur. J. Oper. Res., 2022

Cooperative Blood Inventory Ledger (CoBIL): A decentralized decision-making framework for improving blood product management.

Rishabh Bhandawat, Sabrina Casucci, Bina Ramamurthy, Jose L. Walteros

Comput. Ind. Eng., 2022

2021

A resiliency analysis of information distribution policies over mobile ad hoc networks.

Ningji Wei, Jose L. Walteros, McKenzie R. Worden, Héctor J. Ortiz-Peña

Optim. Lett., 2021

Integer Programming Formulations for Minimum Spanning Tree Interdiction.

Ningji Wei, Jose L. Walteros, Foad Mahdavi Pajouh

INFORMS J. Comput., 2021

2020

On the distance between random events on a network.

Ningji Wei, Jose L. Walteros, Rajan Batta

Networks, 2020

Why Is Maximum Clique Often Easy in Practice?

Jose L. Walteros, Austin Buchanan

Oper. Res., 2020

A participatory approach based on stochastic optimization for the spatial allocation of Sustainable Urban Drainage Systems for rainwater harvesting.

María Nariné Torres, John E. Fontecha, Zhenduo Zhu, Jose L. Walteros, Juan Pablo Rodríguez

Environ. Model. Softw., 2020

Solving the petroleum replenishment and routing problem with variable demands and time windows.

Yan Cheng Hsu, Jose L. Walteros, Rajan Batta

Ann. Oper. Res., 2020

2019

Detecting critical node structures on graphs: A mathematical programming approach.

Jose L. Walteros, Alexander Veremyev, Panos M. Pardalos, Eduardo L. Pasiliao

Networks, 2019

2018

Integer programming models for detecting graph bipartitions with structural requirements.

Chrysafis Vogiatzis, Jose L. Walteros

Networks, 2018

2016

Guest editorial: revised selected papers from the LION 8 conference.

Panos M. Pardalos, Chrysafis Vogiatzis, Jose L. Walteros

Ann. Math. Artif. Intell., 2016

2015

Hybrid Algorithm for Route Design on Bus Rapid Transit Systems.

Jose L. Walteros, Andrés L. Medaglia, Germán Riaño

Transp. Sci., 2015

Minimum edge blocker dominating set problem.

Foad Mahdavi Pajouh, Jose L. Walteros, Vladimir Boginski, Eduardo L. Pasiliao

Eur. J. Oper. Res., 2015

2014

Solving maximum clique in sparse graphs: an O(nm+n2^d/4 algorithm for d-degenerate graphs.

Austin Buchanan, Jose L. Walteros, Sergiy Butenko, Panos M. Pardalos

Optim. Lett., 2014

Integer programming models for the multidimensional assignment problem with star costs.

Jose L. Walteros, Chrysafis Vogiatzis, Eduardo L. Pasiliao, Panos M. Pardalos

Eur. J. Oper. Res., 2014

2012

A Decomposition Approach for Solving Critical Clique Detection Problems.

Jose L. Walteros, Panos M. Pardalos

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2010

A note on branch-and-cut-and-price.

Dominique Feillet, Michel Gendreau, Andrés L. Medaglia, Jose L. Walteros

Oper. Res. Lett., 2010