Strong Formulations for Network Design Problems with Connectivity Requirements

Strong Formulations for Network Design Problems with Connectivity Requirements

The network design problem with connectivity requirements (NDC) models a wide variety of celebrated combinatorial optimization problems including the minimum spanning tree, Steiner tree, and survivable network design problems. We develop strong formulations for two versions of the edge-connectivity...

Full description

Bibliographic Details
Main Authors:	Magnanti, Thomas L., Raghavant, S.
Format:	Working Paper
Language:	en_US
Published:	Massachusetts Institute of Technology, Operations Research Center 2004
Online Access:	http://hdl.handle.net/1721.1/5334

Similar Items

Formulations and algorithms for network design problems with connectivity requirements
by: Raghavan, S., 1966-
Published: (2005)

Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems
by: Magnanti, Thomas L., et al.
Published: (2012)

The Multi-Network Design Problem
by: Balakrishnan, Anantaram, et al.
Published: (2004)

Strong mixed-integer formulations for the floor layout problem
by: Dey, Santanu S., et al.
Published: (2019)

The Convex Hull of Two Core Capacitated Network Design Problems
by: Magnanti, Thomas L., et al.
Published: (2004)

Doubling or Splitting: Strategies for Modeling and Analyzing Survivable Network Design Problems
by: Balakrishnan, Anantaram, et al.
Published: (2004)

A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
by: Magnanti, Thomas L., et al.
Published: (2004)

Strong mixed-integer programming formulations for trained neural networks
by: Anderson, Ross, et al.
Published: (2021)

Design requirements formulation : a framework and analysis
by: Morocz Bazzani, Francisco Andres
Published: (2013)

Pup Matching: Model Formulations and Solution Approaches
by: Bossert, John M., et al.
Published: (2004)

Pup Matching: Model Formulations and Solution Approaches
by: Bossert, J.M., et al.
Published: (2003)

Modeling and Solving the Capacitated Network Loading Problem
by: Magnanti, Thomas L., et al.
Published: (2004)

Optimization problems in network connectivity
by: Panigrahi, Debmalya
Published: (2013)

Systematic errors in connectivity inferred from activity in strongly recurrent networks
by: Das, Abhranil, et al.
Published: (2021)

Shortest Paths, Network Design and Associated Polyhedra
by: Magnanti, Thomas L., et al.
Published: (2004)

Designing Hierarchical Survivable Networks
by: Balakrishnan, Anantaram, et al.
Published: (2004)

Close encounters: Analyzing how social similarity and propinquity contribute to strong network connections.
by: Reagans, Ray Eugene
Published: (2012)

Location Games and Bounds for Median Problems
by: Haimovich, Mordecai, et al.
Published: (2004)

Network Flow Models for Designing Diameter-Constrained Minimum Spanning and Steiner Trees
by: Gouveia, Luis, et al.
Published: (2004)

Designing Satellite Communication Networks by Zero-One Quadratic Programming
by: Helme, Marcia P., et al.
Published: (2004)

Logical connectivity : applications, requirements, and an architecture
Published: (2003)

Heuristics, LPs, and Trees on Trees: Network Design Analyses
by: Balakrishnan, Anantaram, et al.
Published: (2004)

Averaging Schemes for Solving Fived Point and Variational Inequality Problems
by: Magnanti, Thomas L., et al.
Published: (2004)

A Dual-Based Algorithm for Multi-Level Network Design
by: Balakrishnan, Anantaram, et al.
Published: (2004)

A Dual Ascent Procedure for Large Scale Uncapacitated Network Design
by: Balakrishnan, Anantaram, et al.
Published: (2004)

Investigating nutrient requirements of grouper fish for feed formulation
by: Soong, Cai Juan, et al.
Published: (2016)

Small and strong formulations for unions of convex sets from the Cayley embedding
by: Vielma Centeno, Juan Pablo
Published: (2019)

Solving parametric design problems requiring configuration choices
by: Ramaswamy, Rajan., et al.
Published: (2009)

Soft connections: Addressing the hardware-design modularity problem
by: Pellauer, Michael Ignatius, et al.
Published: (2010)

Connecting Consumer Plastic Formulations to Marine Fates and Impacts
by: Walsh, Anna Nicole
Published: (2024)

Valid Inequalities and Facets of the Capacitated Plant Location Problem
by: Leung, Janny M. Y., et al.
Published: (2004)

Nutrients Requirements and Composition in A Grouper Fish Feed Formulation
by: Soong, Cai-Juan, et al.
Published: (2016)

Moist Formulations of the Eliassen–Palm Flux and Their Connection to the Surface Westerlies
by: Dwyer, John G, et al.
Published: (2017)

Lime requirement assessment methods and lime reaction time on strongly acid soils
by: Syed Rastan, Syed Omar, et al.
Published: (1999)

Generative Adversarial Networks for Inverse Design Problems in Engineering: Methods to handle performance, constraints, and creativity requirements
by: Heyrani Nobari, Amin
Published: (2022)

Analysis of the Uncapacitated Dynamic Lot Size Problem
by: Britan, Gabriel R., et al.
Published: (2004)

Study on technical requirements for distributed generators connecting to power grid
by: Munukutla, Sruti Keerti
Published: (2016)

Pax6 is required for the normal development of the forebrain axonal connections
Published: (2002)

Connectivity-splitting models for survivable network design
Published: (2004)

A Comparison of Mixed-Integer Programming Models for Non-Convex Piecewise Linear Cost Minimization Problems
by: Croxton, Keely L., et al.
Published: (2004)