The following pages link to (Q4845371):
Displaying 50 items.
- The capacitated minimum spanning tree problem: On improved multistar constraints (Q1887863) (← links)
- Algorithms for synthesizing mechanical systems with maximal natural frequencies (Q1926188) (← links)
- Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs (Q1969869) (← links)
- Solving the optimum communication spanning tree problem (Q1991267) (← links)
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles (Q2042074) (← links)
- The continuous maximum capacity path interdiction problem (Q2083925) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
- A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077) (← links)
- Two-stage combinatorial optimization problems under risk (Q2283029) (← links)
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
- The recoverable robust spanning tree problem with interval costs is polynomially solvable (Q2361123) (← links)
- On the adjustment problem for linear programs (Q2370336) (← links)
- A branch and cut algorithm for the hierarchical network design problem (Q2379520) (← links)
- Modeling and solving the rooted distance-constrained minimum spanning tree problem (Q2384910) (← links)
- A Steiner arborescence model for the feeder reconfiguration in electric distribution networks (Q2387239) (← links)
- Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks (Q2427201) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- The prize-collecting generalized minimum spanning tree problem (Q2476612) (← links)
- The multi-weighted Steiner tree problem: A reformulation by intersection (Q2483504) (← links)
- Persistence in discrete optimization under data uncertainty (Q2502201) (← links)
- A Benders decomposition approach for the robust spanning tree problem with interval data (Q2503220) (← links)
- A node rooted flow-based model for the local access network expansion problem (Q2654316) (← links)
- Optimizing access to drinking water in remote areas. Application to Nepal (Q2669783) (← links)
- New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← links)
- (Q2741333) (← links)
- A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs (Q2782732) (← links)
- Unified Algorithms for Online Learning and Competitive Analysis (Q2806821) (← links)
- Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm (Q2883578) (← links)
- Finding Totally Independent Spanning Trees with Linear Integer Programming (Q3195324) (← links)
- Lower and upper bounds for the degree-constrained minimum spanning tree problem (Q3593370) (← links)
- Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem (Q3627705) (← links)
- Approaches to the Steiner Problem in Networks (Q3637313) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
- Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- Influence Maximization with Latency Requirements on Social Networks (Q5085986) (← links)
- Learning in Combinatorial Optimization: What and How to Explore (Q5144784) (← links)
- Algorithms for Finding Diameter-constrained Graphs with Maximum Algebraic Connectivity (Q5326888) (← links)
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding (Q5865336) (← links)
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)
- The projected pairwise multicommodity flow polyhedron (Q5938940) (← links)
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585) (← links)
- A comparison of Steiner tree relaxations (Q5946825) (← links)
- The robust spanning tree problem with interval data (Q5949905) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)
