scientific article; zbMATH DE number 795222
From MaRDI portal
Publication:4845371
Trees (05C05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18) Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)
Recommendations
Cited in
(only showing first 100 items - show all)- Minimizing the stabbing number of matchings, trees, and triangulations
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Combinatorial optimization in system configuration design
- Packing and covering a tree by subtrees
- Bottom-up tree acceptors
- Planning models for freight transportation
- Designing reliable tree networks with two cable technologies
- The 2-hop spanning tree problem
- An exact algorithm for IP column generation
- Generalized spanning trees
- Service network design in freight transportation
- The p-arborescence star problem: formulations and exact solution approaches
- Spanning trees with a constraint on the number of leaves. A new formulation
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
- The repeater tree construction problem
- Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
- Ordered weighted average optimization in multiobjective spanning tree problem
- Efficient determination of the k most vital edges for the minimum spanning tree problem
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
- Exact algorithms for the minimum power symmetric connectivity problem in wireless networks
- Generalized network design problems.
- On Steiner trees and minimum spanning trees in hypergraphs
- The capacitated minimum spanning tree problem: On improved multistar constraints
- Optimizing constrained subtrees of trees
- Algorithms for synthesizing mechanical systems with maximal natural frequencies
- Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
- Solving the optimum communication spanning tree problem
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
- The continuous maximum capacity path interdiction problem
- Political districting to minimize cut edges
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- A polyhedral study of the diameter constrained minimum spanning tree problem
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- Two-stage combinatorial optimization problems under risk
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- The recoverable robust spanning tree problem with interval costs is polynomially solvable
- On the adjustment problem for linear programs
- A branch and cut algorithm for the hierarchical network design problem
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- A Steiner arborescence model for the feeder reconfiguration in electric distribution networks
- Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- The prize-collecting generalized minimum spanning tree problem
- The multi-weighted Steiner tree problem: A reformulation by intersection
- Persistence in discrete optimization under data uncertainty
- A Benders decomposition approach for the robust spanning tree problem with interval data
- A node rooted flow-based model for the local access network expansion problem
- Optimizing access to drinking water in remote areas. Application to Nepal
- New formulations and branch-and-cut procedures for the longest induced path problem
- The generalized minimum spanning tree: polyhedra and branch-and-cut
- A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs
- Unified algorithms for online learning and competitive analysis
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
- Spanning trees with variable degree bounds
- Design is as easy as optimization
- Finding totally independent spanning trees with linear integer programming
- scientific article; zbMATH DE number 4174333 (Why is no real title available?)
- scientific article; zbMATH DE number 3853098 (Why is no real title available?)
- scientific article; zbMATH DE number 3867066 (Why is no real title available?)
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- Trees with Convex Faces and Optimal Angles
- Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem
- Approaches to the Steiner Problem in Networks
- scientific article; zbMATH DE number 3914115 (Why is no real title available?)
- scientific article; zbMATH DE number 3963210 (Why is no real title available?)
- Lower and upper bounds for the spanning tree with minimum branch vertices
- scientific article; zbMATH DE number 20617 (Why is no real title available?)
- Balanced spanning forests and trees
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
- scientific article; zbMATH DE number 1305528 (Why is no real title available?)
- The minimum spanning tree problem with conflict constraints and its variations
- Spanning Trees and Optimization Problems
- Differential approximation of NP-hard problems with equal size feasible solutions
- Integer programming problems using a polynomial number of variables and constraints for combinatorial optimization problems in graphs
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Exact and Approximation Algorithms for the Expanding Search Problem
- Influence maximization with latency requirements on social networks
- Bounded-degree rooted tree and TDI-Ness
- Learning in combinatorial optimization: what and how to explore
- Algorithms for finding diameter-constrained graphs with maximum algebraic connectivity
- Computational methods for logistics problems related to optimal trees
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- LATIN 2004: Theoretical Informatics
- The projected pairwise multicommodity flow polyhedron
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- A comparison of Steiner tree relaxations
- The robust spanning tree problem with interval data
- MIP formulations for induced graph optimization problems: a tutorial
- Two‐phase strategies for the bi‐objective minimum spanning tree problem
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic
- Two dependency constrained spanning tree problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845371)
