<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd" xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://ivanaljubic.github.io/portfolio/benders-decomposition-for-facility-location/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/portfolio/bilevel-integer-programming-interdiction-problems/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/portfolio/connected-facility-location-problems/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/portfolio/connectivity-augmentation-problems-in-graphs/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/portfolio/prize-collecting-steiner-tree-problem-a-branch-and-bound-algorithm-dapcstp/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/portfolio/prize-collecting-steiner-tree/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/portfolio/regenerator-location-problem/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/portfolio/stay-nerd/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/portfolio/steiner-tree-problem-with-revenues-budget-and-hop-constraints/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/portfolio/steiner-tree-problems-in-graph/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/portfolio/stochastic-steiner-tree/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/portfolio/stochastic-survivable-network-design/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/portfolio/the-k-cardinality-tree-problem/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/portfolio/the-recoverable-robust-two-level-network-design-problem/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/posts/2012/08/blog-post-1/</loc>
<lastmod>2012-08-14T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/posts/2013/08/blog-post-2/</loc>
<lastmod>2013-08-14T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/posts/2014/08/blog-post-3/</loc>
<lastmod>2014-08-14T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/posts/2012/08/blog-post-4/</loc>
<lastmod>2015-08-14T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/posts/2012/08/blog-post-4/</loc>
<lastmod>2199-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2000-01-01-a-genetic-algorithm-for-the-biconnectivity-augmentation-problem</loc>
<lastmod>2000-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2000-01-01-a-hybrid-ga-for-the-edge-biconnectivity-augmentation-problem</loc>
<lastmod>2000-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2001-01-01-an-evolutionary-algorithm-with-stochastic-hill-climbing-for-the-edge-biconnectivity-augmentation-problem</loc>
<lastmod>2001-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2001-01-01-solving-the-simple-plant-location-problem-by-genetic-algorithm</loc>
<lastmod>2001-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2002-01-01-a-memetic-algorithm-for-vertex-biconnectivity-augmentation</loc>
<lastmod>2002-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2002-01-01-evolutionary-local-search-for-the-edge-biconnectivity-augmentation-problem</loc>
<lastmod>2002-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2003-01-01-a-genetic-algorithm-for-the-index-selection-problem</loc>
<lastmod>2003-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2003-01-01-a-memetic-algorithm-for-minimum-cost-vertex-biconnectivity-augmentation-of-graphs</loc>
<lastmod>2003-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2003-01-01-the-fractional-prize-collecting-steiner-tree-problem-on-trees</loc>
<lastmod>2003-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2004-01-01-combining-a-memetic-algorithm-with-integer-programming-to-solve-the-prize-collecting-steiner-tree-problem</loc>
<lastmod>2004-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2004-11-01-exact-and-memetic-algorithms-for-two-network-design-problems</loc>
<lastmod>2004-11-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2005-01-01-solving-the-prize-collecting-steiner-tree-problem-to-optimality</loc>
<lastmod>2005-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2006-01-01-an-algorithmic-framework-for-the-exact-solution-of-the-prize-collecting-steiner-tree-problem</loc>
<lastmod>2006-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2007-01-01-a-hybrid-vns-for-connected-facility-location</loc>
<lastmod>2007-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2008-01-01-a-grasp-algorithm-for-connected-facility-location</loc>
<lastmod>2008-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2008-01-01-obtaining-optimal-k-cardinality-trees-fast</loc>
<lastmod>2008-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2008-01-01-strong-formulations-for-2-node-connected-steiner-network-problems</loc>
<lastmod>2008-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2009-01-01-exact-approaches-to-the-single-source-network-loading-problem</loc>
<lastmod>2009-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2009-01-01-obtaining-optimal-k-cardinality-trees-fast</loc>
<lastmod>2009-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2009-01-01-the-generalized-regenerator-location-problem</loc>
<lastmod>2009-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2010-01-01-a-branch-and-cut-and-price-algorithm-for-vertex-biconnectivity-augmentation</loc>
<lastmod>2010-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2010-01-01-modelling-the-hop-constrained-connected-facility-location-problem-on-layered-graphs</loc>
<lastmod>2010-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2010-01-01-orientation-based-models-for-%7B0,1,2%7D-survivable-network-design:-theory-and-practice</loc>
<lastmod>2010-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2010-01-01-solving-two-stage-stochastic-steiner-tree-problems-by-two-stage-branch-and-cut</loc>
<lastmod>2010-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2010-01-01-the-regenerator-location-problem</loc>
<lastmod>2010-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2011-01-01-a-node-splitting-technique-for-two-level-network-design-problems-with-transition-nodes</loc>
<lastmod>2011-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2011-01-01-exact-solutions-for-the-robust-prize-collecting-steiner-tree-problem</loc>
<lastmod>2011-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2011-01-01-mip-modeling-of-incremental-connected-facility-location</loc>
<lastmod>2011-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2011-01-01-mip-models-for-connected-facility-location:-a-theoretical-and-computational-study</loc>
<lastmod>2011-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2012-01-01-exact-approaches-to-the-single-source-network-loading-problem</loc>
<lastmod>2012-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2012-01-01-on-the-hop-constrained-steiner-tree-problem-with-multiple-root-nodes</loc>
<lastmod>2012-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2012-01-01-qtl-mapping-using-a-memetic-algorithm-with-modifications-of-bic-as-fitness-function</loc>
<lastmod>2012-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2012-01-01-variable-neighborhood-search-for-solving-the-balanced-location-problem</loc>
<lastmod>2012-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2013-01-01-a-cutting-plane-algorithm-for-the-capacitated-connected-facility-location-problem</loc>
<lastmod>2013-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2013-01-01-a-note-on-the-bertsimas-and-sim-algorithm-for-robust-combinatorial-optimization-problems</loc>
<lastmod>2013-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2013-01-01-enhanced-formulations-and-branch-and-cut-for-the-two-level-network-design-problem-with-transition-facilities</loc>
<lastmod>2013-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2013-01-01-exact-approaches-for-solving-robust-prize-collecting-steiner-tree-problems</loc>
<lastmod>2013-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2013-01-01-lagrangian-decompositions-for-the-two-level-fttx-network-design-problem</loc>
<lastmod>2013-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2013-01-01-layered-graph-approaches-to-the-hop-constrained-connected-facility-location-problem</loc>
<lastmod>2013-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2013-01-01-on-the-two-architecture-connected-facility-location-problem</loc>
<lastmod>2013-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2013-01-01-solving-the-bi-objective-prize-collecting-steiner-tree-problem-with-the-e-constraint-method</loc>
<lastmod>2013-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2013-01-01-stochastic-survivable-network-design-problems</loc>
<lastmod>2013-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2013-01-01-the-maximum-weight-connected-subgraph-problem</loc>
<lastmod>2013-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2013-01-01-the-rooted-maximum-node-weight-connected-subgraph-problem</loc>
<lastmod>2013-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2014-01-01-a-mip-based-heuristic-approach-to-solve-a-prize-collecting-local-access-network-design-problem</loc>
<lastmod>2014-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2014-01-01-a-partition-based-heuristic-for-the-steiner-tree-problem-in-large-graphs</loc>
<lastmod>2014-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2014-01-01-hop-constrained-steiner-trees-with-multiple-root-nodes</loc>
<lastmod>2014-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2014-01-01-on-the-asymmetric-connected-facility-location-polytope</loc>
<lastmod>2014-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2015-01-01-a-computational-study-of-exact-approaches-for-the-bi-objective-prize-collecting-steiner-tree-problem</loc>
<lastmod>2015-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2015-01-01-ilp-and-cp-formulations-for-the-lazy-bureaucrat-problem</loc>
<lastmod>2015-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2015-01-01-the-generalized-regenerator-location-problem</loc>
<lastmod>2015-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2015-01-01-the-recoverable-robust-two-level-network-design-problem</loc>
<lastmod>2015-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2015-01-01-the-two-level-diameter-constrained-spanning-tree-problem</loc>
<lastmod>2015-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2016-01-01-a-node-based-layered-graph-approach-for-the-steiner-tree-problem-withrevenues,-budget-and-hop-constraints</loc>
<lastmod>2016-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2016-01-01-benders-decomposition-without-separability:-a-computational-study-for-capacitated-facility-location-problems</loc>
<lastmod>2016-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2016-01-01-ilp-heuristics-and-a-new-exact-method-for-bi-objective-0/1-ilps:-application-to-fttx-network-design</loc>
<lastmod>2016-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2016-01-01-intersection-cuts-for-bilevel-optimization</loc>
<lastmod>2016-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2017-01-01-a-new-general-purpose-algorithm-for-mixed-integer-bilevel-linear-programs</loc>
<lastmod>2017-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2017-01-01-a-node-based-ilp-formulation-for-the-node-weighted-dominating-steiner-problem</loc>
<lastmod>2017-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2017-01-01-an-algorithmic-framework-for-the-exact-solution-of-tree-star-problems</loc>
<lastmod>2017-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2017-01-01-an-effective-dynamic-programming-algorithm-for-the-minimum-cost-maximal-knapsack-packing-problem</loc>
<lastmod>2017-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2017-01-01-feature-cluster:-recent-advances-in-exact-methods-for-multi-objective-optimisation</loc>
<lastmod>2017-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2017-01-01-operations-research-proceedings-2015</loc>
<lastmod>2017-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2017-01-01-redesigning-benders-decomposition-for-large-scale-facility-location</loc>
<lastmod>2017-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2017-01-01-solving-minimum-cost-shared-arborescence-problems</loc>
<lastmod>2017-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2017-01-01-stochastic-survivable-network-design-problems:-theory-and-practice</loc>
<lastmod>2017-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2017-01-01-thinning-out-steiner-trees:-a-node-based-model-for-uniform-edge-costs</loc>
<lastmod>2017-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2018-01-01-a-dual-ascent-based-branch-and-bound-framework-for-the-prize-collecting-steiner-tree-and-related-problems</loc>
<lastmod>2018-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2018-01-01-decomposition-methods-for-the-two-stage-stochastic-steiner-tree-problem</loc>
<lastmod>2018-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2018-01-01-on-the-use-of-intersection-cuts-for-bilevel-optimization</loc>
<lastmod>2018-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2018-01-01-outer-approximation-and-submodular-cuts-for-maximum-capture-facility-location-problems-with-random-utilities</loc>
<lastmod>2018-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2018-01-01-the-connected-facility-location-polytope</loc>
<lastmod>2018-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2019-01-01-a-new-branch-and-bound-algorithm-for-the-maximum-edge-weighted-clique-problem</loc>
<lastmod>2019-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2019-01-01-benders-decomposition-for-very-large-scale-partial-set-covering-and-maximal-covering-problems</loc>
<lastmod>2019-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2019-01-01-exact-approaches-for-network-design-problems-with-relays</loc>
<lastmod>2019-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2019-01-01-exact-approaches-for-the-directed-network-design-problem-with-relays</loc>
<lastmod>2019-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2019-01-01-interdiction-games-and-monotonicity,-with-application-to-knapsack-problems</loc>
<lastmod>2019-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2019-01-01-the-incremental-connected-facility-location-problem</loc>
<lastmod>2019-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2019-01-01-the-maximum-clique-interdiction-problem</loc>
<lastmod>2019-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2019-01-01-tighter-mip-formulations-for-barge-container-ship-routing</loc>
<lastmod>2019-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2020-01-01-a-polyhedral-study-of-the-diameter-constrained-minimum-spanning-tree-problem</loc>
<lastmod>2020-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2020-01-01-location-of-charging-stations-in-electric-car-sharing-systems</loc>
<lastmod>2020-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2020-01-01-on-integer-and-bilevel-formulations-for-the-k-vertex-cut-problem</loc>
<lastmod>2020-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2020-01-01-preface:-decomposition-methods-for-hard-optimization-problems</loc>
<lastmod>2020-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2020-01-01-virtual-network-functions-placement-and-routing-problem:-path-formulation</loc>
<lastmod>2020-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2021-01-01-a-branch-and-cut-algorithm-for-the-edge-interdiction-clique-problem</loc>
<lastmod>2021-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2021-01-01-an-exact-method-for-assortment-optimization-under-the-nested-logit-model</loc>
<lastmod>2021-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2021-01-01-benders-decomposition-for-a-node-capacitated-virtual-network-functions-placement-and-routing-problem</loc>
<lastmod>2021-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2021-01-01-casting-light-on-the-hidden-bilevel-combinatorial-structure-of-the-capacitated-vertex-separator-problem</loc>
<lastmod>2021-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2021-01-01-new-ip-based-lower-bounds-for-small-ramsey-numbers-using-circulant-graphs</loc>
<lastmod>2021-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2021-01-01-solving-steiner-trees---recent-advances,-challenges-and-perspectives</loc>
<lastmod>2021-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2021-01-01-survey-on-mixed-integer-programming-techniques-in-bilevel-optimization</loc>
<lastmod>2021-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2021-01-01-the-generalized-reserve-set-covering-problem-with-connectivity-and-buffer-requirements</loc>
<lastmod>2021-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2022-01-01-Combinatorial-Optimization</loc>
<lastmod>2022-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2022-01-01-a-tailored-benders-decomposition-approach-for-last-mile-delivery-with-autonomous-robots</loc>
<lastmod>2022-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2022-01-01-budgeting-in-international-humanitarian-organizations</loc>
<lastmod>2022-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2022-01-01-comparison-of-formulations-for-the-inventory-routing-problem</loc>
<lastmod>2022-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2022-01-01-socp-based-disjunctive-cuts-for-a-class-of-integer-nonlinear-bilevel-programs</loc>
<lastmod>2022-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2022-02-01-arc-routing-with-electric-vehicles:-dynamic-charging-and-speed-dependent-energy-consumption</loc>
<lastmod>2022-02-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2022-10-30-an-exact-method-for-fortification-games</loc>
<lastmod>2022-10-30T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2022-11-28-maximizing-submodular-utility-functions-combined-with-a-set-union-operator-over-a-discrete-set</loc>
<lastmod>2022-11-28T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2023-01-17-two-extended-formulations-for-the-virtual-network-function-placement-and-routing-problem</loc>
<lastmod>2023-01-17T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2023-01-18-A-Brief-Introduction-to-Robust-Bilevel-Optimization</loc>
<lastmod>2023-01-18T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2023-01-18-A-Survey-on-Bilevel-Optimization-Under-Uncertainty</loc>
<lastmod>2023-01-18T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2023-01-27-freight-on-transit-for-urban-last-mile-deliveries:-a-strategic-planning-approach</loc>
<lastmod>2023-01-27T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2023-04-10-ConFL-Encyclopedia</loc>
<lastmod>2023-04-10T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2023-04-21-Mathematical-Programming-Formulations-for-the-Collapsed-k-Core-Problem</loc>
<lastmod>2023-04-21T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2023-04-28-Common-Flow</loc>
<lastmod>2023-04-28T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2023-05-27-benders-adaptive-cuts-method-for-two-stage-stochastic-programs</loc>
<lastmod>2023-05-27T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2023-05-27-exact-methods-for-discrete</loc>
<lastmod>2023-05-27T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2024-01-01-New-formulations-interconnected</loc>
<lastmod>2024-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2024-01-10-ArcRoutingChapter</loc>
<lastmod>2024-01-10T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2024-01-15-DOMP-Benders</loc>
<lastmod>2024-01-15T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2024-01-17-Pricing</loc>
<lastmod>2024-01-17T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2024-01-21-Congested-Partial-Set-Covering</loc>
<lastmod>2024-01-21T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2022-01-01-the-impact-of-passive-social-media-users-in-(competitive)-influence-maximization</loc>
<lastmod>2024-02-03T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2024-04-10-UsingDisjunctiveCuts</loc>
<lastmod>2024-04-10T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2024-04-14-On-SOCP-based-disjunctive-cuts-for-solving-a-class-of-integer-bilevel-nonlinear-programs</loc>
<lastmod>2024-04-14T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2024-4-29-Bilevel-MCF</loc>
<lastmod>2024-04-29T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2024-05-20-A-bilevel-approach-for-compensation</loc>
<lastmod>2024-05-20T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2024-05-20-Reinforcement-Learning-Approaches-for-the-Orienteering-Problem-with-Stochastic-and-Dynamic-Release-Dates</loc>
<lastmod>2024-05-20T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2024-5-29-SustainableBilevel</loc>
<lastmod>2024-05-29T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2023-04-14-three-network-design-problems-for-community-energy-storage</loc>
<lastmod>2024-06-19T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2024-7-17-BOBILib</loc>
<lastmod>2024-07-17T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2024-10-10-PCSTP-and-its-variants</loc>
<lastmod>2024-10-10T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2025-02-14-SDD-survey</loc>
<lastmod>2025-02-14T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/publication/2025-04-04-HeuristicBS</loc>
<lastmod>2025-04-04T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2005-01-22-solving-the-prize-collecting-steiner-tree-problem-to-optimality</loc>
<lastmod>2005-01-22T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2006-07-31-optimization-in-telecommunication-networks:-multicommodity-flow,-facility-location-and-steiner-tree-problems</loc>
<lastmod>2006-07-31T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2007-02-12-connected-facility-location-vns-tabu-search-and-branch-and-cut</loc>
<lastmod>2007-02-12T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2007-03-19-connected-facility-location-in-the-design-of-telecommunication-networks</loc>
<lastmod>2007-03-19T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2007-07-22-facility-location-and-steiner-trees</loc>
<lastmod>2007-07-22T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2007-10-08-a-hybrid-vns-for-connected-facility-location</loc>
<lastmod>2007-10-08T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2008-03-27-solving-connected-facility-location-to-provable-optimality</loc>
<lastmod>2008-03-27T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2008-05-10-strong-formulations-for-2-node-connected-steiner-network-problems</loc>
<lastmod>2008-05-10T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2008-10-12-benders-cuts-for-the-single-source-network-loading-problem</loc>
<lastmod>2008-10-12T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2009-01-11-exact-approaches-to-the-single-source-network-loading-problem</loc>
<lastmod>2009-01-11T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2009-04-26-the-generalized-regenerator-location-problem</loc>
<lastmod>2009-04-26T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2009-08-23-a-branch-and-cut-and-price-algorithm-for-vertex-biconnectivity-augmentation</loc>
<lastmod>2009-08-23T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2010-05-05-mip-models-for-connected-facility-location-a-theoretical-and-computational-study</loc>
<lastmod>2010-05-05T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2010-05-10-the-generalized-regenerator-location-problem</loc>
<lastmod>2010-05-10T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2010-06-27-two-stage-branch-&amp;-cut-for-two-stage-stochastic-network-design-problems</loc>
<lastmod>2010-06-27T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2010-07-11-the-generalized-regenerator-location-problem</loc>
<lastmod>2010-07-11T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2010-07-28-solving-two-stage-stochastic-steiner-tree-problems-by-two-stage-branch-and-cut</loc>
<lastmod>2010-07-28T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2010-08-16-dissaggregated-flow-formulation-for-the-single-source-network-loading-problem</loc>
<lastmod>2010-08-16T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2010-08-16-opttelnets:-algorithmische-ans%C3%A4tze</loc>
<lastmod>2010-08-16T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2011-01-10-a-two-level-network-design-problem-with-transition-nodes</loc>
<lastmod>2011-01-10T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2011-06-13-the-two-level-network-design-problem-with-secondary-hop-constraints</loc>
<lastmod>2011-06-13T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2011-10-21-the-generalized-regenerator-location-problem</loc>
<lastmod>2011-10-21T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2012-01-27-solving-two-stage-stochastic-steiner-tree-problems-by-two-stage-branch-and-cut</loc>
<lastmod>2012-01-27T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2012-03-15-on-the-hop-constrained-steiner-tree-problem-with-multiple-root-nodes</loc>
<lastmod>2012-03-15T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2012-03-15-solving-two-stage-network-design-problems-by-two-stage-branch-and-cut</loc>
<lastmod>2012-03-15T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2012-04-04-optimization-tools-for-last-mile-access-networks</loc>
<lastmod>2012-04-04T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2012-04-17-capacitated-network-design-and-facility-location</loc>
<lastmod>2012-04-17T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2012-04-26-the-recoverable-robust-two-level-network-design-problem</loc>
<lastmod>2012-04-26T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2012-07-04-solving-2-stage-stochastic-network-design-problems-by-2-stage-branch-and-cut</loc>
<lastmod>2012-07-04T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2012-07-08-capacitated-network-design-with-facility-location</loc>
<lastmod>2012-07-08T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2012-08-19-layered-graph-models-for-hop-constrained-trees-with-multiple-roots</loc>
<lastmod>2012-08-19T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2012-11-22-the-maximum-weight-connected-subgraph-problem</loc>
<lastmod>2012-11-22T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2013-07-03-the-maximum-weight-connected-subgraph-problem</loc>
<lastmod>2013-07-03T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2013-08-29-the-maximum-weight-connected-subgraph-problem:-applications-in-bioinformatics</loc>
<lastmod>2013-08-29T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2014-05-13-the-recoverable-robust-facility-location-problem</loc>
<lastmod>2014-05-13T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2014-05-21-the-recoverable-robust-facility-location-problem</loc>
<lastmod>2014-05-21T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2014-05-21-the-recoverable-robust-two-level-network-design-problem</loc>
<lastmod>2014-05-21T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2015-03-10-a-new-modeling-concept-for-facility-location-under-uncertainty</loc>
<lastmod>2015-03-10T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2015-03-28-the-diameter-constrained-minimum-spanning-tree-problem:-polyhedral-study</loc>
<lastmod>2015-03-28T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2015-05-06-a-polyhedral-study-of-the-diameter-constrained-minimum-spanning-tree-problem</loc>
<lastmod>2015-05-06T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2015-05-11-mip-approaches-to-the-lazy-bureaucrat-and-greedy-boss-problems</loc>
<lastmod>2015-05-11T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2015-05-12-exact-approaches-to-the-network-design-problem-with-relays</loc>
<lastmod>2015-05-12T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2015-05-20-a-node-based-layered-graph-approach-for-hop-constrained-steiner-trees</loc>
<lastmod>2015-05-20T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2015-07-14-ilp-formulations-for-the-lazy-bureaucrat-problem</loc>
<lastmod>2015-07-14T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2015-09-02-exact-approaches-to-the-network-design-problem-with-relays</loc>
<lastmod>2015-09-02T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2015-09-17-on-optimal-design-of-charging-stations-for-electric-vehicles</loc>
<lastmod>2015-09-17T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2015-10-19-redesigning-benders-decomposition-for-large-scale-facility-location</loc>
<lastmod>2015-10-19T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2016-02-10-solving-congested-facility-location-by-branch-and-cut</loc>
<lastmod>2016-02-10T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2016-03-21-solving-minimum-cost-shared-arborescence-problems</loc>
<lastmod>2016-03-21T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2016-05-16-exact-approaches-for-network-design-problems-with-relays</loc>
<lastmod>2016-05-16T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2016-06-13-generalized-benders-cuts-for-congested-facility-location</loc>
<lastmod>2016-06-13T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2016-07-05-intersection-cuts-for-mixed-integer-bilevel-linear-programs</loc>
<lastmod>2016-07-05T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2016-07-11-a-new-exact-solver-for-mixed-integer-bilevel-linear-programs-based-in-intersection-cuts</loc>
<lastmod>2016-07-11T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2016-10-08-a-new-general-purpose-algorithm-for-mixed-integer-bilevel-linear-programs</loc>
<lastmod>2016-10-08T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2016-11-08-interdiction-games-and-monotonicity</loc>
<lastmod>2016-11-08T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2017-02-23-on-clique-interdiction-problems-in-graphs</loc>
<lastmod>2017-02-23T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2017-02-28-clique-interdiction-in-the-social-network-analysis</loc>
<lastmod>2017-02-28T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2017-06-16-a-dual-ascent-based-branch-and-bound-framework-for-the-prize-collecting-steiner-tree-and-related-problems</loc>
<lastmod>2017-06-16T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2017-09-06-new-decomposition-approaches-for-the-two-stage-stochastic-steiner-tree-problem</loc>
<lastmod>2017-09-06T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2017-09-07-outer-approximation-and-submodular-cuts-for-maximum-capture-facility-location-problems-with-random-utilities</loc>
<lastmod>2017-09-07T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2017-09-22-decomposition-methods-for-stochastic-steiner-trees</loc>
<lastmod>2017-09-22T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2017-12-07-on-benders-decomposition-for-facility-location</loc>
<lastmod>2017-12-07T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2018-01-01-mip-modeling-of-incremental-connected-facility-location</loc>
<lastmod>2018-01-01T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2018-03-26-exact-general-purpose-solvers-for-mixed-integer-bilevel-linear-programs</loc>
<lastmod>2018-03-26T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2018-06-08-the-directed-network-design-problem-with-relays</loc>
<lastmod>2018-06-08T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2018-06-11-new-branch-and-cut-algorithms-for-mixed-integer-bilevel-linear-programs</loc>
<lastmod>2018-06-11T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2018-06-18-branch-and-cut-algorithms-for-mixed-integer-bilevel-linear-programs</loc>
<lastmod>2018-06-18T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2018-06-18-recent-developments-on-exact-solvers-for-the-(prize-collecting)-steiner-tree-problem</loc>
<lastmod>2018-06-18T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2018-07-03-decomposition-approaches-to-covering-location-problems</loc>
<lastmod>2018-07-03T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2018-07-09-benders-decomposition-for-covering-location-problems</loc>
<lastmod>2018-07-09T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2018-08-17-very-large-scale-covering-location-problems-in-the-design-of-advanced-metering-infrastructure</loc>
<lastmod>2018-08-17T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2018-08-23-a-new-branch-and-cut-algorithm-for-interdiction-problems-with-monotonicity</loc>
<lastmod>2018-08-23T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2018-09-12-from-game-theory-to-graph-theory:-a-bilevel-journey</loc>
<lastmod>2018-09-12T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2018-10-08-very-large-scale-covering-location-problems-in-the-design-of-advanced-metering-infrastructure</loc>
<lastmod>2018-10-08T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2018-11-02-clique-interdiction-attacks-in-networks</loc>
<lastmod>2018-11-02T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2019-01-30-solving-very-large-scale-covering-location-problems-using-branch-and-benders-cut</loc>
<lastmod>2019-01-30T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2019-06-02-optimal-vehicle-routing-with-autonomous-devices-for-last-mile-delivery</loc>
<lastmod>2019-06-02T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2019-06-12-on-integer-and-bilevel-formulations-for-the-k-vertex-cut-problem</loc>
<lastmod>2019-06-12T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2019-06-23-from-game-theory-to-graph-theory:-a-bilevel-journey</loc>
<lastmod>2019-06-23T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2019-10-20-a-new-bilevel-approach-for-the-k-vertex-cut-problem</loc>
<lastmod>2019-10-20T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2020-01-20-branch-and-benders-cut-algorithms:-modern-implementations-of-benders-decomposition</loc>
<lastmod>2020-01-20T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2020-05-18-casting-light-on-the-hidden-bilevel-structure-of-the-capacitated-vertex-separator-problem</loc>
<lastmod>2020-05-18T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2020-08-30-new-integer-and-bilevel-formulations-for-the-k-vertex-cut-problem</loc>
<lastmod>2020-08-30T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2020-10-12-branch-and-cut-solvers-for-mixed-integer-bilevel-linear-programs</loc>
<lastmod>2020-10-12T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2020-10-20-two-branch-and-cut-algorithms-for-the-directed-network-design-problem-with-relays</loc>
<lastmod>2020-10-20T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2021-02-12-new-integer-and-bilevel-formulations-for-the-k-vertex-cut-problem</loc>
<lastmod>2021-02-12T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2021-02-25-panel-discussion-real-world-optimisation-models:-successes-and-pitfalls</loc>
<lastmod>2021-02-25T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2021-07-11-the-edge-interdiction-clique-problem</loc>
<lastmod>2021-07-11T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2021-07-20-mixed-integer-bilevel-optimization</loc>
<lastmod>2021-07-20T00:00:00-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/2022-11-30-bilevel-optimization-under-uncertainty</loc>
<lastmod>2022-11-30T00:00:00-08:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/teaching/2014-spring-teaching-1</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/archive-layout-with-content/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/categories/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/collection-archive/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/cv/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/markdown/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/non-menu-page/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/page-archive/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/portfolio/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/publications/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/sitemap/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/tags/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/talkmap.html</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/talks/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/_pages/teaching-not-used/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/teaching/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/terms/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/year-archive/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/og-README/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/markdown_generator/</loc>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/pcstp/dhea-Manual.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/ANoteBSAlgorithm.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/ANoteBSAlgorithm_old.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/ANoteBSAlgorithm_oldold.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/AOPNL.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/BCSP.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/BC_RPCSTP.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/CFLP-theory.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/CIG.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/CapConFL.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/CapConFL_old.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/CommonFlow_TR.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/ConFL.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/ConFL_Encyclopedia.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/DOMP-Benders.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/FractPCSTP.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/GRLP.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/HCConFL_LG_IJOC.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/HCConFL_LG_IJOC_old.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/HCConFL_OR.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/HCConFL_Poly_TR.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/INOC2009.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/INOC2009ChenLjubicRaghavan.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/IRP.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/ISCO2010.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/IncrementalFacility_INOC2011.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/InterconnectedFacilities.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/MKLSTP-main.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/MaxCapture.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/NetworksSI.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/PCLAN2011.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/RPCSTP_RNDM_TechReport.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/RRTLND.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/RRUFLP-main.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/SDDsurvey.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/SSNDP.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/SSNLP.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/SSNLP_old.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/STP-HM.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/STPRBH-techreport.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/TLNDF-EJOR.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/TLNDF-INOC2011.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/TLNDF-TR.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/TR_March2009.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/TechReport.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/TechReport_SSNDP.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/ThinningOutSteinerTrees.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/UnrootedMWCS-TR.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/VNF_Networks.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/aConFL-ISCO.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/appendix_final.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/bopcstp_techreport.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/clan-preprint.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/da-TR.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/dmstp-TR.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/grsccb-techreport.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/independentSystems-TR.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/interdiction_games_and_monotonicity.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/kCardinalityTrees_JEA.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/kVertexCut_rev.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/kcard.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/ljubicPhD.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/mewc_bb_rev.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/ms_final_TR.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/nwst.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/rlp.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/rootedMWCS_final.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/sndp.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/sstp.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/thinning_out_facilities.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/twoNCON-TR.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/publications/ymodel_final.pdf</loc>
<lastmod>2025-07-27T09:57:39-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/slides/COMEX_Ljubic_Full.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/slides/ECSO2017_Ljubic.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/slides/EURO2019_Ljubic.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/slides/EURO_20150714.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/slides/INOC2019_Ljubic.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/slides/IWOLOCA2019_Ljubic.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/slides/JFRO_Ljubic.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/slides/OR2018_Ljubic_slides.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/slides/Odysseus2018_Ljubic.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/slides/Optimization2017_Ljubic.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/slides/PGMOdays.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/slides/TRISTAN2016_Ljubic.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/slides/Workshop_Ljubic.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/slides/informsTelecom2018_Ljubic.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/stay-nerd/staynerd_user_manual.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/docs/stp/realworld-stp-report-short.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/files/PGMOdays.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/files/paper1.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/files/paper2.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/files/paper3.pdf</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/markdown_generator/dblp.html</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
<url>
<loc>https://ivanaljubic.github.io/talkmap/map.html</loc>
<lastmod>2025-07-27T09:57:40-07:00</lastmod>
</url>
</urlset>
