Integer Programming Models and Branch-And-Cut Approaches to Generalized {0,1,2}-Survivable Network Design Problems

Computational Optimization and Applications - Netherlands
doi 10.1007/s10589-016-9836-y
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

A Branch-And-Bound Algorithm for Zero-One Mixed Integer Programming Problems

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1971English

Polyhedral Approaches to Mixed Integer Linear Programming

2009English

Online and Stochastic Survivable Network Design

2009English

Decomposition and Dynamic Cut Generation in Integer Linear Programming

Mathematical Programming, Series B
MathematicsSoftware
2005English

Large-Scale Bi-Level Strain Design Approaches and Mixed-Integer Programming Solution Techniques

PLoS ONE
Multidisciplinary
2011English

A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design

Transportation Science
CivilTransportationStructural Engineering
2014English

An Effective Branch-And-Bound Algorithm for Convex Quadratic Integer Programming

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Chvátal Closures for Mixed Integer Programming Problems

Mathematical Programming, Series B
MathematicsSoftware
1990English

Design Survivable WDM Mesh Network Using Path Protection

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy