Jose L. Walteros

MaRDI QIDQ319913zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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

Research outcomes over time

This page was built for person: Jose L. Walteros