Jose L. Walteros

Available identifiers

Publication	Date of Publication	Type
On the distance between random events on a network	2023-11-13	Paper
Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations	2023-06-23	Paper
Worst-case analysis of clique MIPs	2022-10-24	Paper
Integer Programming Formulations for Minimum Spanning Tree Interdiction	2022-06-28	Paper
Integer programming methods for solving binary interdiction games	2022-06-08	Paper
Why Is Maximum Clique Often Easy in Practice?	2021-01-19	Paper
Solving the petroleum replenishment and routing problem with variable demands and time windows	2021-01-07	Paper
Detecting critical node structures on graphs: a mathematical programming approach	2019-03-06	Paper
Integer programming models for detecting graph bipartitions with structural requirements	2018-09-04	Paper
Minimum edge blocker dominating set problem	2016-10-06	Paper
Selected topics in critical element detection	2015-07-01	Paper
Integer programming models for the multidimensional assignment problem with star costs	2015-02-19	Paper
Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs	2014-12-05	Paper
A note on branch-and-cut-and-price	2010-12-20	Paper

This page was built for person: Jose L. Walteros