The following pages link to Ivana Ljubić (Q299846):
Displaying 37 items.
- (Q3153223) (← links)
- On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes (Q3167625) (← links)
- Intersection Cuts for Bilevel Optimization (Q3186493) (← links)
- On the Asymmetric Connected Facility Location Polytope (Q3195346) (← links)
- The Generalized Regenerator Location Problem (Q3466768) (← links)
- (Q4418387) (← links)
- (Q4472033) (← links)
- A node‐based ILP formulation for the node‐weighted dominating Steiner problem (Q4565770) (← links)
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs (Q4602475) (← links)
- The Rooted Maximum Node-Weight Connected Subgraph Problem (Q4922919) (← links)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
- A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems (Q5131733) (← links)
- Exact Approaches for Network Design Problems with Relays (Q5137444) (← links)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
- Obtaining Optimal<i>k</i>-Cardinality Trees Fast (Q5233508) (← links)
- The Maximum Weight Connected Subgraph Problem (Q5265172) (← links)
- Obtaining optimal <i>k</i> -cardinality trees fast (Q5406206) (← links)
- Strong Formulations for 2-Node-Connected Steiner Network Problems (Q5505657) (← links)
- ILP and CP Formulations for the Lazy Bureaucrat Problem (Q5741471) (← links)
- Modelling the hop constrained connected facility location problem on layered graphs (Q5891541) (← links)
- Algorithms - ESA 2003 (Q5897287) (← links)
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- A survey on bilevel optimization under uncertainty (Q6096565) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- New formulations for two location problems with interconnected facilities (Q6128897) (← links)
- An exact method for binary fortification games (Q6167322) (← links)
- Mathematical programming formulations for the collapsed k-core problem (Q6168587) (← links)
- Two extended formulations for the virtual network function placement and routing problem (Q6179721) (← links)
- Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs (Q6392523) (← links)
- Operational Research: Methods and Applications (Q6509328) (← links)
- Three Network Design Problems for Community Energy Storage (Q6518959) (← links)
- Emerging Optimization Problems for Distribution in Same-day Delivery (Q6533991) (← links)
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs (Q6589745) (← links)
- Three network design problems for community energy storage (Q6659084) (← links)
- The Multi-Commodity Flow Problem with Outsourcing Decisions (Q6731329) (← links)
- Bilevel optimization with sustainability perspective: a survey on applications (Q6732179) (← links)
