scientific article; zbMATH DE number 795222
From MaRDI portal
Publication:4845371
zbMath0839.90135MaRDI QIDQ4845371
Laurence A. Wolsey, Thomas L. Magnanti
Publication date: 23 June 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Trees (05C05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Communication networks in operations research (90B18) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items
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, Computational comparisons of different formulations for the Stackelberg minimum spanning tree game, Maximum weighted induced forests and trees: new formulations and a computational comparative review, Branch‐and‐cut algorithms for the ‐arborescence star problem, Constraint relaxation for the discrete ordered median problem, Lagrangian relaxation for maximum service in multicast routing with QoS constraints, Solving Steiner trees: Recent advances, challenges, and perspectives, Weighted target set selection on trees and cycles, A graph-based decomposition method for convex quadratic optimization with indicators, Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds, An efficient mixed integer linear programming model for the minimum spanning tree problem, Vertex covering with capacitated trees, Wildlife reserve design with connectivity and buffer requirements, Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm, The recoverable robust spanning tree problem with interval costs is polynomially solvable, Partial inverse min-max spanning tree problem, Extended formulations for the cardinality constrained subtree of a tree problem, The \(p\)-arborescence star problem: formulations and exact solution approaches, On the adjustment problem for linear programs, Spanning trees with variable degree bounds, The capacitated minimum spanning tree problem: On improved multistar constraints, Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates, A branch and cut algorithm for the hierarchical network design problem, Exact algorithms for budgeted prize-collecting covering subgraph problems, Modeling and solving the rooted distance-constrained minimum spanning tree problem, A Steiner arborescence model for the feeder reconfiguration in electric distribution networks, An exact algorithm for IP column generation, Network flow models for the local access network expansion problem, 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, Lower bounds and exact algorithms for the quadratic minimum spanning tree problem, Finding Totally Independent Spanning Trees with Linear Integer Programming, An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees, A node rooted flow-based model for the local access network expansion problem, Unnamed Item, Algorithms for Finding Diameter-constrained Graphs with Maximum Algebraic Connectivity, 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, A branch and bound algorithm for the minimax regret spanning arborescence, Lower and upper bounds for the spanning tree with minimum branch vertices, Algorithms for synthesizing mechanical systems with maximal natural frequencies, Optimizing access to drinking water in remote areas. Application to Nepal, New formulations and branch-and-cut procedures for the longest induced path problem, Lagrangean bounds for the optimum communication spanning tree problem, Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol, MIP formulations for induced graph optimization problems: a tutorial, On the approximability of robust spanning tree problems, 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, A polyhedral study of the diameter constrained minimum spanning tree problem, New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints, Bounded-degree spanning tree problems: models and new algorithms, The minimum spanning tree problem with conflict constraints and its variations, Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs, Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs, Optimizing phylogenetic diversity with ecological constraints, A linear programming-based evolutionary algorithm for the minimum power broadcast problem in wireless sensor networks, Branch-and-cut-and-price for capacitated connected facility location, Learning in Combinatorial Optimization: What and How to Explore, Solving the minimum label spanning tree problem by mathematical programming techniques, The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm, Minimum power multicasting problem in wireless networks, Solving the optimum communication spanning tree problem, Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem, Ordered weighted average optimization in multiobjective spanning tree problem, The prize-collecting generalized minimum spanning tree problem, An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem, Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem, A branch and cut algorithm for minimum spanning trees under conflict constraints, The multi-weighted Steiner tree problem: A reformulation by intersection, Exact algorithms for OWA-optimization in multiobjective spanning tree problems, The projected pairwise multicommodity flow polyhedron, A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem, Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems, The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm, New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints, MIP models for connected facility location: a theoretical and computational study, The capacitated minimum spanning tree problem: revisiting hop-indexed formulations, Lower and upper bounds for the degree-constrained minimum spanning tree problem, A comparison of Steiner tree relaxations, A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs, The robust spanning tree problem with interval data, Exact algorithms for the minimum power symmetric connectivity problem in wireless networks, Persistence in discrete optimization under data uncertainty, A Benders decomposition approach for the robust spanning tree problem with interval data, Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem, Exact solution approaches for the multi-period degree constrained minimum spanning tree problem, Two-stage combinatorial optimization problems under risk, Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints, Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles, Minimizing the stabbing number of matchings, trees, and triangulations, Unified Algorithms for Online Learning and Competitive Analysis, Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem, Generalized network design problems., Computing and minimizing the relative regret in combinatorial optimization with interval data, Approaches to the Steiner Problem in Networks, Differential approximation of NP-hard problems with equal size feasible solutions, Combinatorial optimization in system configuration design, Planning models for freight transportation, Designing reliable tree networks with two cable technologies, Generalized spanning trees, The continuous maximum capacity path interdiction problem, Mixed-integer programming approaches for the tree \(t^*\)-spanner problem, Service network design in freight transportation, The 2-hop spanning tree problem, Political districting to minimize cut edges, Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding, On Steiner trees and minimum spanning trees in hypergraphs, Upper and lower bounding strategies for the generalized minimum spanning tree problem
