The following pages link to Ivana Ljubić (Q299846):
Displaying 50 items.
- Hop constrained Steiner trees with multiple root nodes (Q299847) (← links)
- Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← links)
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
- Lagrangian decompositions for the two-level FTTx network design problem (Q743641) (← links)
- Evolutionary local search for the edge-biconnectivity augmentation problem (Q1603576) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- The connected facility location polytope (Q1686059) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- Benders decomposition for very large scale partial set covering and maximal covering location problems (Q1719620) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
- Solving minimum-cost shared arborescence problems (Q1751722) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities (Q1754055) (← links)
- On the use of intersection cuts for bilevel optimization (Q1800991) (← links)
- The generalized reserve set covering problem with connectivity and buffer requirements (Q2029278) (← links)
- An exact method for assortment optimization under the nested logit model (Q2030643) (← links)
- A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
- Comparison of formulations for the inventory routing problem (Q2160484) (← links)
- On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
- A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities (Q2253496) (← links)
- A MIP-based approach to solve the prize-collecting local access network design problem (Q2256343) (← links)
- The incremental connected facility location problem (Q2329719) (← links)
- The two-level diameter constrained spanning tree problem (Q2340278) (← links)
- Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
- A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems (Q2441360) (← links)
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
- Benders decomposition for a node-capacitated virtual network function placement and routing problem (Q2668658) (← links)
- Solving the simple plant location problem by genetic algorithm (Q2765605) (← links)
- (Q2770481) (← links)
- Variable neighborhood search for solving the balanced location problem (Q2840746) (← links)
- Exact approaches to the single-source network loading problem (Q2892148) (← links)
- The Recoverable Robust Two-Level Network Design Problem (Q2942678) (← links)
- A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem (Q2942688) (← links)
- The regenerator location problem (Q3057148) (← links)
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation (Q3057179) (← links)
- Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut (Q3060753) (← links)
- A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes (Q3091483) (← links)
- The Two Level Network Design Problem with Secondary Hop Constraints (Q3091484) (← links)
- A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem (Q3091494) (← links)
- MIP Modeling of Incremental Connected Facility Location (Q3091533) (← links)
