Handbook of Optimization in Telecommunications (HOT)

3rd Generation Partnership Project (3GPP), Technical Specification

A fast algorithm for the maximum clique problem

Scatter search for a network design problem

TRLabs Network Systems Group $p$-cycles website.

A Lagrangian heuristic for the linear ordering problem

A relax and cut algorithm for the traveling salesman problem

Dynamic Bundle Methods

Non Delayed Relax-and-Cut Algorithms

Steiner problem in graphs: Lagrangean relaxation and cutting planes

Steiner problem in graphs: Lagrangean relaxation and cutting planes

Capacitated facility location: Separation algorithms and

computational experience

Capacitated facility location: separation algorithms and computational experience

Market split and basis reduction: towards a solution of the Cornuéjols-Dawande instances

Models and Solution Techniques for Frequency Assignment Problems

Solving a system of linear diophantine equations with lower and upper bounds on the variables

Algorithms for radio link frequency assignment: the CALMA project

Capacitated facility location: Valid inequalities and facets

Preface: algebraic and geometric methods in discrete optimization

Models and solution techniques for frequency assignmentproblems

A branch-and-cut algorithm for the frequency assignment problem

Selected topics in simulated annealing

Simulated Annealing and Boltzmann Machines

Simulated annealing and Boltzmann machines: A stochastic approach to combinatorial optimization and neural computing

Local Search in Combinatorial Optimization

Bioinformatics and management science: some common tools and techniques

Tabu search based heuristics for multi-floor facility

layout

Residential broadband

A functional approach to external graph algorithms

Finding independent sets in a graph using continuous multivariable polynomial formulations

On Maximum Clique Problems in Very Large Graphs

On maximum clique problems in very large graphs

On maximum clique problems in very large graphs

Massive quasi-clique detection

Massive quasi-clique detection

Inter-redes IP baseadas em redes Óticas

Series-parallel bounds for the two-terminal reliability problem

Computing 2-terminal reliability for radio-broadcast networks

A neural approach to topological optimization of communication networks, with reliability constraints

A facet generation and relaxation technique applied to an assignment problem with side constraints

Design issues for combinatorial auctions

An algorithm for multiparametric mixed-integer linear programming problems

Algorithms for the minimum weight spanning tree with bounded diameter problem

Security-control methods for statistical databases: a comparative study

The small world Web

Power-law distribution of the World Wide Web

Unconstrained 0-1 optimization and Lagrangian relaxation

On the equivalence between roof duality and Lagrangian duality for unconstrained 0-1 quadratic programming problems

Persistency in 0-1 polynomial programming

Linearization strategies for a class of zero-one mixed integer programming problems

A simple algorithm to incorporate transactions costs in quadratic optimization

Allocating fibers in cable manufacturing

Distributed multicast tree generation with dynamic group membership

A global optimization method, $$BB, for general twice-differentiable constrained NLPs --- I. Theoretical advances

A global optimization method, $$BB, for general twice-differentiable constrained NLPs --- II. Implementation and computational results

Global optimization of MINLP problems in process synthesis and design

Baseball, optimization, and the world wide web

Data structures and programming techniques for the implementation of Karmarkar's algorithm

Limiting behavior of the affine scaling continuous trajectories for linear programming problems

An implementation of Karmarkar's algorithm for linear programming

Synchronous Optical Networks (SONET) Fiber Optic Transmission Systems Requirements and Objectives

Interior point column generation algorithms for adaptive filtering

Algorithms for the special cases of rectilinear Steiner trees: I. Points on the boundary of a rectilinear rectangle

Design of capacitated multicommodity networks with multiple facilities

On finding critical independent and vertex sets

Optimized crossover for the independent set problem

Reliability evaluation by network decomposition

Topological layout of links for optimising the overall reliability in a computer communication system

Topological layout of links for optimizing the s-t reliability in a computer communication system

Reliability evaluation in computer-communication networks

A flexible multicast routing protocol for group communication

Indefinite quadratic fractional programming with a quadratic constraint

Quadratic fractional functionals programming

Optimizing constrained subtrees of trees

Coloring powers of Planar Graphs

Optimal packet scheduling in UTRA-TDD

When trees collide: An approximation algorithm for the generalized Steiner problem in networks

When trees collide: an approximation algorithm

for the generalized Steiner problem on networks

When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks

Mining association rules between sets of items in large databases

Parallel mining of association rules: Design, implementation and experience

Fast algorithms for mining association rules

Architecture for a multimedia teleconferencing system

Dynamic Routing and Call Control in High-Speed Integrated Networks

Mean-risk objectives in stochastic programming

A Multi-stage Stochastic Integer Programming Approach for Capacity Expansion under Uncertainty

The Sample Average Approximation Method for Stochastic Programs with Integer Recourse

Optimal bandwidth allocation for bandwidth adaptation in wireless multimedia networks

Rectilinear Steiner trees: Efficient special-case algorithms

The Design and Analysis of Computer Algorithms

The design and analysis of computer algorithms

UMTS Location for Network Planning and Optimization in Urban Areas

Mobile Terminal Location for UMTS

Network Flows: Theory, Algorithms, and Applications

Network Flows : Theory and Algorithms

Inverse optimization

A fast scaling algorithm for minimizing separable convex functions subject to chain constraints

Equivalence of the primal and dual simplex algorithms for the maximum flow problem

A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem

Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem

New neighborhood search structures for the capacitated minimum spanning tree problem

Network Flows: Theory, Algorithms, and Applications

Faster algorithms for the shortest path problem

A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem

Multi-exchange neighborhood search structures for the

capacitated minimum spanning tree problem

A greedy genetic algorithm for the quadratic

assignment problem

Random evolution in massive graphs

A random graph model for power law graphs

Parallel GRASP with path-relinking for job shop scheduling

Probability distribution of solution time in GRASP: An experimental investigation

Uma investigação experimental da distribuição de probabilidade de tempo de solução em heursticas GRASP e sua aplicação na análise de implementações paralelas

Parallel GRASP with path-relinking for job

shop scheduling

GRASP with path-relinking for three-index assignment

Probability distribution of solution time in

GRASP: An experimental investigation

Facility Location Models for Distribution Planning

Topics in Relaxation and Ellipsoidal Methods

An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem

The Overload Performance of Engineered Networks with Nonhierarchical and Hierarchical Routing

A polyhedral approach to single-machine scheduling problems

Parallel machine scheduling by column generation

Time-indexed formulations for machine scheduling problems: column generation

The impact of ERP on supply chain management: Exploratory findings from a European Delphi study

Multicell CDMA Network Design

An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems

A Globally Convergent Interior Point Algorithm for General Non-Linear Programming Problems

Generating short-term observations for space mission projects

A new dominance rule to minimize total weighted tardiness

with unequal release dates

On finitely terminating branch-and-bound algorithms for some global optimization problems

Towards Milli-Second IGP Convergence

Online algorithms: a survey

Diameter of the World-Wide Web

On-line portfolio selection strategy with prediction in the presence of transaction costs

A network dimensioning tool

Survivable mobile phone network architectures: models and solution methods

Cost-efficient network synthesis from leased lines

Cost-efficient network synthesis from leased lines

Performance-oriented placement and routing for field-programmable gate arrays

An architecture-independent approach to FPGA routing based on multi-weighted graphs

A new approach to FPGA routing based on multi-weighted graphs

An interior point method for the Euclidean distance matrix completion problem

Optimization of Splitting Node Placement in Wavelength-Routed Optical Networks

Allocation of Multicast Nodes in Wavelength-Routed Networks

Allocation of Splitting Nodes in All-Optical Wavelength-Routed Networks

Routing and Wavelength Assignment with Power Considerations in Optical Networks

Genetic Algorithm for Routing in WDM Optical Networks with Power Considerations. Part I: The Unicast Case

WaveTunnel-Accurately Designing Deployable Optical Networks

Interior Point Methods in Semidefinite Programming with

Applications to Combinatorial Optimization

Second-order cone programming

SDPpack User's Guide, Version 0.8 BETA

Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results

Complementarity and nondegeneracy in semidefinite programming

Symmetric cones, potential reduction methods, and word-by-word extensions

Optimization with semidefinite, quadratic and linear constraints

Convex optimization problems involving finite autocorrelation sequences

A Park and Ride integrated system

A polynomial case of unconstrained zero-one quadratic optimization

An Incremental Procedure for Improving Path Assignment in a Telecommunications Network

Lower Bounding Techniques for Frequency Assignment

TCP Congestion Control

Um Modelo para Definicão de uma Rede Backbone Pública ATM

Scheduling workover rigs for onshore oil production

A fast and simple randomized parallel algorithm for the maximal independent set problem

Testing of clustering

The concentration of the chromatic number of random graphs

An efficient and easily deployable QoS-based routing scheme for online Internet multicasting

Constrained nonlinear programming for volatility estimation with GARCH models

Approximating k-Hop Minimum-Spanning Trees

Topological Design of Ring Networks

Heuristics with constant error guarantees for the design of tree networks

Heuristics for Ring Network Design

Topological design of wide area communication networks

Reliability optimization of computer communication networks using genetic algorithms

Regularized Symmetric Indefinite Systems in Interior Point Methods for Linear and Quadratic Optimization

Non-cooperative routing in loss networks

Competitive routing in networks with polynomial costs

A tabu search algorithm for large-scale guillotine

(un)constrained two-dimensional cutting problems

A computational study of heuristic algorithms for

two-dimensional cutting stock problems

Parallelization strategies for the metaheuristic GRASP

Load balancing for the parallelization of the GRASP metaheuristic

Parallelization strategies for the metaheuristic GRASP

Load balancing in the parallelization of the metaheuristic

GRASP

Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks

A simple parallel algorithm for the maximal independent set problem

Message-optimal connected dominating sets in mobile ad hoc networks

Distributed heuristics for connected dominating sets in wireless ad hoc networks

Distributed Heuristics for Connected Dominating Set in Wireless Ad Hoc Networks

Optimizing base station location and configuration in UMTS networks

Optimizing base station location and configuration in UMTS networks

On a new class of set covering problems arising in WLAN design

Optimizing WLAN Radio Coverage

Radio planning and coverage optimization of 3G cellular networks

Planning UMTS Base Station Location: Optimization Models With Power Control and Algorithms

Planning UMTS base station location: Optimization models with power control and algorithms

Planning UMTS Base Station Location: Optimization models with power control and algorithms

Optimizing UMTS radio coverage via base station configuration

Discrete Models and Algorithms for the Capacitated Location Problems Arising in UMTS Network Planning

Base Station Configuration and Location Problems

in UMTS Networks

Discrete models and algorithms for the capacitated location

problem arising in UMTS network planning

Optimizing Base Station Siting in UMTS Networks

Improved models and algorithms for UMTS radio planning

Optimization models and algorithms for downlink UMTS radio planning

Optimization models and algorithms for

downlink UMTS radio planning.

A mathematical programming approach for W-CDMA radio planning with uplink and downlink constraints

UMTS Radio Planning: Optimizing Base Station Configuration

Classes of small-world networks

Upper bounds on the order of a clique of a graph

A system for the design of packet-switched communication networks with economics tradeoffs

The design of service systems with queueing time cost, workload capacities and backup service

A system for the design of packet-switched communication networks with economic tradeoffs

Solution procedures for the service system design problem

The multi-hour bandwidth packing problem

Routing and capacity assignment in backbone communication networks under time varying traffic conditions

Primary and secondary route selection in backbone communication networks

Primary and secondary route selection in backbone communication networks

Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures

Max-min d-cluster formation in wireless ad hoc networks

Load-balancing clusters in wireless ad hoc networks

On the optimality of cyclic transmission in teletext systems

A mobility-based clustering approach to support mobility management and multicast routing in mobile ad-hoc wireless networks

D.C. programming approach for multicommodity network optimization problems with step increasing cost functions

Globally minimizing a quadratic function under convex quadratic constraints

Optimization of Telecommunication Networks

On primal and dual infeasibility certificates in a homogeneous model for convex optimization

On exploiting problem structure in a basis identifications procedure for linear programming

Linear Optimization: Theory, methods, and extensions

The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm

A parallel interior-point algorithm for linear programming on a shared memory machine

The APOS linear programming solver: an implementation of the homogeneous algorithm

Presolving in linear programming

Implementation of interior point methods for large scale linear programming

A homogenized cutting plane method to solve the convex feasibility problem

On implementing a primal-dual interior-point method for conic quadratic optimization

On a homogeneous algorithm for the monotone complementarity problem

A computational study of the homogeneous algorithm for large-scale convex optimization

Combining interior-point and pivoting algorithms for linear programming

A modified Schur complement method for handling dense columns in interior point methods for linear programming

A Newton barrier method for minimizing a sum of euclidean norms subject to linear equality constraints

A symmetric primal-dual Newton method for minimizing a sum of norms

An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms

Soft and Safe Admission Control in Cellular Networks

A Contract and Balancing Mechanism for Sharing Capacity in a Comm unication Network

A direct search algorithm for optimization with noisy function evaluations

Linear Programming in Infinite-Dimensional Spaces

A class of continuous network flow problems

A continuous-time network simplex algorithm

Optical Interface Unit-Bridge to the Next-Generation Packet Network

Integer programming for combinatorial auction winner determination

Credit risk optimization with conditional value-at-risk criterion

Planning network design under uncertainty with fixed charge

Heuristics for the phylogeny problem

A framework for the development of local search

heuristics for combinatorial optimization problems

An object-oriented framework for local search heuristics

Template Algorithm for One-Hop Packet Routing

Approximation algorithms for access network design

Motif-GRASP and Motif-ILS: Two new stochastic local search algorithms for motif finding

An Integer Linear Programming Approach to Steiner Problem in Graphs

An integer linear programming approach to the Steiner problem in graphs

An Integer Linear Programming Approach to the Steiner Problem in Graphs

Maximal expected flow in a network subject to arc failures

Ellipsoidal approach to box-constrained quadratic problems

A $53$-approximation algorithm for the clustered traveling salesman tour and path problems

On semidefinite programming relaxations for the satisfiability problem

A semidefinite programming approach for the nearest correlation matrix problem

Strengthened semidefinite relaxations via a second lifting for the MAX-CUT problem

Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks

A Tight Semidefinite Relaxation of the Cut Polytope

Integrating E-commerce and data mining: Architecture and challenges

Recent advances in the solution of quadratic assignment problems

Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem

Improved complexity for maximum volume inscribed ellipsoids

The volumetric barrier for semidefinite programming

Improved Linear Programming Bounds for Antipodal Spherical Codes

Towards a Practical Volumetric Cutting Plane Method for Convex Programming

Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier

Linear Programming in $O([n^3/ n]L)$ Operations

On the Equivalence of Convex Programming Bounds for Boolean Quadratic Programming

The Volumetric Barrier for Convex Quadratic Constraints

On Vaidya's volumetric cutting plane method for convex programming

Volumetric path following algorithms for linear programming

Potential Reduction Algorithms

Large step volumetric potential reduction algorithms for linear programming

On the performance of Karmarkar's algorithm over a sequence of iterations

On monotonicity in the scaled potential algorithm for linear programming

A standard form variant, with safeguarded linesearch, for the modified Karmarkar's algorithm

A combined Phase I-Phase II algorithm for linear programming

The worst-case step in Karmarkar's algorithm

Linear programming and the Newton barrier flow

A Monotonic Projection Algorithm for Fractional Linear Programming

A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm

Long steps in a $O(n^3L)$ algorithm for linear programming

A New Bound for the Quadratic Assignment Problem Based on Convex Quadratic Programming

Solving large quadratic assignment problems on computational grids

Strong Duality for a Trust-Region Type Relaxation of the Quadratic Assignment Problem

A Long-Step Path Following Algorithm for Semidefinite Programming Problems

Using continuous nonlinear relaxation to solve constrained maximum-entropy sampling problems

Probabilistic analysis of an infeasible-interior-point algorithm for linear programming

A masked spectral bound for maximum-entropy sampling

A Monotonic Build-Up Simplex Algorithm For Linear Programming

On Lagrangian Relaxation of Quadratic Matrix Constraints

A Note on the Augmented Hessian When the Reduced Hessian is Semidefinite

Bidding behavior in competing auctions: Evidence from eBay

Intra-Domain QoS Routing in IP Networks: A Feasibility and Cost/Benefit Analysis

Every planar map is four colourable. Part I: Discharging

Every planar map is four colourable. Part II: Reducibility

Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems

On the solution of traveling salesman problems

The traveling salesman problem

Finding cuts in the TSP (A preliminary report)

Making Intra-Domain Routing Robust to Changing and Uncertain Traffic Demands: Understanding Fundamental Tradeoffs

Solving large-scale matching problems

A computational study of the job-shop scheduling problem

Load Optimal MPLS Routing with $N+M$ Labels

An approach to integer programming

Optimization by simulated annealing: An experimental evaluation; Part II, Graph coloring and number partitioning

O problema de roteamento de veculos e algumas

metaheursticas

The pooling of cryoprecipitate

Methodological aspects of ring network design

Availability models for protection techniques in WDM networks

A comparison of genetic/memetic algorithms and other

heuristic search techniques

Efficient Hybrid Search Techniques For Circuit Partitioning

A GRASP clustering technique for circuit partitioning

Advanced search techniques for circuit partitioning

GRASP: An effective constructive technique for VLSI circuit partitioning

The buffer tree: A new technique for optimal I/O algorithms

On external memory MST, SSSP and multi-way planar graph separation

A GRASP for aircraft routing in response

to groundings and delays

Randomized methods for the number partitioning problem

Algorithms for Generalized Round Robin Routing

Some complexity results about packet radio networks

On a new collection of stochastic linear programming test problems

Polynomial cutting plane algorithms for two-stage stochastic linear programs based on ellipsoids, volumetric centers, and analytic centers

A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems

Minimization of Functions Having Lipschitz Continuous First-Partial Derivatives

Design of stacked self-healing rings using a genetic algorithm

Design of stacked self-healing rings using a genetic

algorithm

Efficient Algorithms for Combinatorial

Problems on a Graph With Bounded

Decomposability -- A Survey

On the number of minimal 1-Steiner trees

Approximation schemes for NP-hard geometric optimization problems: a survey

Polynomial-time approximation scheme for Euclidean TSP and other geometric problems

Hardness of Approximations

Hardness of Approximations

Proof verification and the hardness of approximation problems

Proof verification and intractability of approximation problems

Proof verification and hardness of approximation problems

Approximating clique is NP-complete

Le Probème de Steiner sur un Graphe Orienté: Formulations et Relaxations

GRASP and tabu search algorithms for computing the

forwarding index in a graph

Initialization of the simplex algorithm: an artificial-free approach

On the equivalence of the multistage-insertion and cycle-shrink formulations of the traveling salesman problem

Combinatorial online optimization in practice

Solving the asymmetric travelling salesman problem with time windows by branch-and-cut

A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints

Performance Evaluation of QoS-Routing Methods for IP-Based Multiservice Networks

Dynamic Routing in Telecommunications Networks

Dynamic Routing in Telecommunication Networks

Design and Optimization of Networks with Dynamic Routing

Design and Optimization of Networks with Dynamic Routing

20 Years of Dynamic Routing in Telephone Networks:

Looking Backward to the Future

20 Years of Dynamic Routing in Circuit-Switched Networks: Looking Backward to the Future

Robust Design and Planning of a Worldwide Intelligent Network

Real-Time Network Routing in a Dynamic Class-of-Service Network

Ill-conditionedness and interior-point methods

Asymptotic behaviour of Karmarkar's method for linear programming

A parallel station heuristic for the mixed-model production line balancing problem

Multicommodity network flows -- A survey

Optical Networking and Real-Time Provisioning: An Integrated Vision for the Next-Generation Internet

On the merit of IP/MPLS protection/restoration in IP over WDM networks

Sequence independent lifting for mixed-integer programming

On capacitated network design cut-set polyhedra

Flow pack facets of the single node fixed-charge flow polytope

A relational modeling system for linear and integer programming

Valid inequalities for problems with additive variable upper bounds

The mixed vertex packing problem

Strong Formulations of Robust Mixed 0-1 Programming

Reliability optimization of communication networks using simulated annealing

Scaling and interior point methods in optimization

A cutting plane algorithm for convex programming that uses analytic centers

A scaling technique for finding the weighted analytic center of a polytope

A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy

Min-Max Heaps and Generalized Priority Queues

Distributed Computing: Fundamentals, Simulations and Advanced Topics

Modeling market uncertainty and competition in telecommunication environment: Network providers and virtual operators

A branch and cut algorithm for non-convex quadratically constrained quadratic programming

Analysis of generalized pattern searches

Pattern search algorithms for mixed variable programming

Penalty and barrier methods: a unified framework

Asymptotic analysis for penalty and barrier methods in convex and linear programming

The Lovely but Lonely Vickrey Auction

An efficient ascending-bid auction for multiple objects

On the $p$-median polytope

Minimizing the span of $d$-walks to compute optimum frequency assignments

A survey of heuristics for the weighted matching problem

On the solitaire cone and its relationship to multi-commodity flows

Stronger linear programming relaxations of max-cut

Economic Applications of the Theory of Graphs

Optimal component configuration and component routing

Generalized Concavity

MPLS and Traffic Engineering in IP Networks

Overview and Principles of Internet Traffic Engineering

Requirements for Traffic Engineering over MPLS

MPLS and Traffic Engineering in IP Networks

Overview and Principles of Internet Traffic Engineering

Requirements for Traffic Engineering Over MPLS

Requirements for traffic engineering over MPLS

Optimal distributed algorithm for minimum weight spanning tree, counting, leader election and related problems

On-line generalized Steiner problem

Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem

Price-directive decomposition applied to routing in telecommunication networks

Simulated annealing: Parallelization techniques

Augmented Lagrangean based algorithms for centralized network design

The stable admissions polytope

Separation of partition inequalities

Separation of partition inequalities

Simulation and Optimization of the Implementation Costs for the Last Mile of Fiber Optic Networks

Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation

Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation

Solving Steiner tree problems in graphs with Lagrangean relaxation

The Volume Algorithm revisited: relation with bundle methods

A mixed integer disjunctive model for transmission

network expansion

A cutting plane method from analytic centers for stochastic

programming

Experimental behavior of an interior-point cutting plane

algorithm for convex programming --- an application to geometric

programming

Bounded error parameter estimation: A sequential analytic center approach

A new efficient large-update primal-dual interior-point method based on a finite barrier

A visual interactive approach to vehicle routing

The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm

Efficient Heuristic Algorithms for the Weighted Set Covering Problem

Computational Results for Very Large Air Crew Scheduling Problems

Circuits, Interconnections, and Packaging for VLSI

Generalized transportation networks with stochastic demands: an operator-theoretic approach

Using a Hop-Constrained Model to Generate Alternative Communication Network Design

Using a hop-constrained model to generate alternative communication network design

Using a hop-constrained model to generate alternative communication network design

Using a hop-constrained model to generate

alternative communication network design

Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems

Designing hierarchical survivable networks

Network design

Models for planning capacity expansion in local access telecommunications networks

A decomposition algorithm for local access telecommunications network expansion planning

Connectivity-splitting models for survivable network design

Connectivity-Splitting Models for Survivable Network Design

Designing hierarchical survivable networks

A dual-based algorithm for multi-level network design

Modeling and heuristic worst-case performance analysis of the two-level network design problem

Modeling and Heuristic Worst-Case Performance Analysis of Two-Level Network Design Problem

A Dual-Based Algorithm for Multi-Level Network Design

Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem

Models for Planning Capacity Expansion in Local Access Telecommunication Networks

Models for Planning Capacity Expansion in Local Access Telecommunication Networks

Models for planning capacity expansion in local access telecommunication networks

Models for planning capacity expansion in local

access telecommunication networks

Telecommunication link restoration planning with multiple facility types

Spare-Capacity Assignment for Line Restoration Using a Single-Facility Type

Telecommunication link restoration planning with multiple facility types

Spare-capacity assignment for line restoration using a single-facility type

A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning

A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design

A dual ascent procedure for large-scale

uncapacitated network design

Problem reduction methods and a tree generation algorithm for the Steiner network problem

Designing hierarchical survivable networks

Projection with a Minimal System of Inequalities

Disjunctive Programming

Intersection cuts --- a new type of cutting planes for integer programming

On unions and dominants of polytopes

A Lift-and-Project Cutting Plane

Algorithm for Mixed 0-1 Programs

Mixed 0--1 programming by lift-and-project in a branch-and-cut framework

A lift-and-project cutting plane algorithm for mixed 0-1 programs

Gomory cuts revisited

Polyhedral methods for the maximum clique problem

OCTANE: A new heuristic for pure 0--1 programs

Lifted cycle inequalities for the asymmetric traveling salesman problem

On the monotonization of polyhedra

The precedence-constrained asymmetric traveling salesman polytope

Pivot and Complement-A Heuristic for 0/1 Programming

On the set covering polytope: I. All the facets with coefficients in 0,1,2

On the set covering polytope: II. Lifting the facets with coefficients in 0,1,2

A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming

An algorithm for the three-index assignment problem

Pivot and shift --- a mixed integer programming heuristic

Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring

Finding a maximum clique in an arbitrary graph

Constructing Test Functions for Global Optimization Using Continuous Formulations of Graph Problems

Novel approaches for analyzing biological networks

Adaptive Real-Time Group Multicast

A Randomized Heuristic for Inequality-Constrained Mixed-Integer Programming

An analysis of alternate strategies for implementing matching algorithms

Complexity of network reliability computations

Complexity of Network Reliability Computations

Computing network reliability

Computing Network Reliability

In: Network reliability

Matroids and a reliability analysis problem

Calculating bounds on reachability and connectedness in stochastic networks

Backtracking algorithms for network reliability analysis

Fault-tolerant virtual path layout in ATM networks

Core-based trees (CBT) -- An architecture for scalable inter-domain multicast routing

Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces

Lifting theorems and facet characterization for a class of clique partitioning inequalities

Simulating sellers in online exchanges

A Genetic Algorithm Approach for Solving the Routing and Wavelength Assignment Problem in WDM Networks

Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study

Wavelength Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and Reconfiguration Study

A practical approach for routing and wavelength assignment in large wavelength-routed optical networks design

Design of Wavelength Routed Optical Networks for Packet Switched Traffic

Steiner Type Problems for Digraphs that are Locally Semicomplete or Extended Semicomplete

Environmental Policy and Transport: An Overview

Practical approach for routing and wavelength assignment in large wavelength routed optical networks

A Clustering Scheme for Hierarchical Control in Wireless Networks

An Efficient Delay-Constrained Multicast Routing Algorithm

A sharp methodology for VLSI layout

A parallel VLSI circuit layout methodology

Examining routing solutions

A theoretical and empirical investigation of multi-item on-line auctions

Origin-Based Algorithms for Transportation Network Modeling

Power-law distribution of the World Wide Web

Emergence of Scaling in Random Networks

Scale-free characteristics of random networks: the topology of the World-Wide Web

Network reinforcement

On the $k$-cut problem

Network design using cut inequalities

Network design using cut inequalities

Ground state magnetization of Ising spin glasses

Separating from the dominant of the spanning tree polytope

Separating from the dominant of the spanning tree polytope

On the computational complexity of Ising spin glass models

The volume algorithm: producing primal solutions with a subgradient method

On some difficult linear programs coming from set partitioning problems

Robust Capacity Planning in Semiconductor Manufacturing

Solving large scale uncapacitated facility location problems

Facets of the bipartite subgraph polytope

An application of combinatorial optimization to statistical physics and circuit layout design

Plant location with minimum inventory

Experiments in quadratic 0-1 programming

Branch and cut based on the volume algorithm: Steiner trees in graphs and max-cut

On the cut polytope

Maximal covering code multiplexing access telecommunication networks

A Heuristic Lagrangean Algorithm for the Capacitated Plant Location Problem

Determining tax credits for converting nonfood crops to biofuels: an application of bilevel programming

An analysis of a rail car unloading area for a consumer

products manufacturer

An algorithm for the manufacturing equipment

selection problem

Operations sequencing in discrete parts

manufacturing

A GRASP for scheduling printed wiring board

assembly

A decomposition approach to the inventory routing problem with satellite facilities

A branch-and-cut procedure for the vehicle routing

problem with time windows

Cones of diagonal dominant matrices

A variation on Karmarkar's algorithm for solving linear programming problems

A sparse matrix version of Karmarkar's algorithm

A polynomial time version of the affine scaling algorithm

Flight string models for aircraft fleeting and routing

Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems

Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems

Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems

Branch-and-price: column generation for solving huge integer programs

Branch-and-Price: Column Generation for Solving Huge Integer Programs

Branch and price: column generation for solving huge integer programs

Analysis and design of resilient multifiber wavelength-routed optical transport networks

Enhancement of spanning tree labeling procedures for network optimization

Designing and Reporting on Computational Experiments with Heuristic Methods

Grooming Telecommunications Networks

Designing and reporting on computational experiments with heuristic methods

Parallel simplex for large pure network problems: computational testing and sources of speedup

Toward a Steiner engine: Enhanced serial and parallel implementations of the iterated 1-Steiner MRST heuristic

M~Tennenholtz (ed.) Incentive compatible multi unit combinatorial auctions

On Solving Large Sparse Linear Systems arising from Linear Programming and Linear Regression

Properties of a class of preconditioners for weighted least squares problems

Finding a Maximal Weighted Independent Set in Wireless Networks

Distributed Clustering for Ad Hoc Networks

An analytic center cutting plane method in conic programming

An analytic center cutting plane approach for conic programming

Road to Ruin

Assigning codes in wireless networks: bounds and scaling properties

Reactive Search for Traffic Grooming in WDM Networks

Local Search Heuristics for Cost Reduction in WDM Bidirectional Rings

Reactive search for Traffic Grooming in WDM networks

Reactive local search for the maximum clique problem

Parallel biased search for combinatorial optimization: Genetic algorithms and Tabu

Multicast routing in point-to-point networks under constraints

ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm

ARIES: A rearrangeable inexpensive edge-based on-line Steiner algorithm

Degree-constrained multicasting in point-to-point networks

Degree-Constrained Multicasting in Point-to-Point Networks

The circuit polytope: facets

A branch and cut approach to The Cardinality Constrained Circuit problem

Intractable computations without local minima

A Warehouse Location Problem

Procedimientos para la localización de áreas de aportación de residuos urbanos

Local search heuristics for the assembly line balancing

problem with incompatibilities between tasks

Transmission facility planning in telecommunications networks: a heuristic approach

The nonlinear geometry of linear programming, I. Affine and projective scaling trajectories

The nonlinear geometry of linear programming, II. Legendre transform coordinates and central trajectories

Aerodynamic sensitivity analysis methods for the compressible Euler equations

Aerodynamic shape optimization using sensitivity analysis on third-order Euler equations

Linear Programming and Network Flows

Nonlinear Programming: Theory and Algorithms

Nonlinear Programming: Theory and Algorithms

Nonlinear Programming: Theory and Algorithms

Linear Programming and Network Flows

Nonlinear programming -- Theory and algorithms

Branch and Bound Methods for Mathematical Programming Systems

Special Facilities in a General Mathematical Programming System for Nonconvex Problems Using Ordered Sets of Variables

Reducing travel costs and player fatigue in the NBA

Braess's paradox in a loss network

The shortest path through many points

An algorithm for the Steiner problem in graphs

A heuristic for Euclidean and rectilinear Steiner problems

An SST-based algorithm for the Steiner problem in graphs

An algorithm for set covering problems

A tree search algorithm for the crew scheduling problem

An evolutionary heuristic for the index tracking problem

Lagrangean relaxation

OR-Library: Distributing test problems by electronic mail

OR-Library: distributing test problems by electronic mail

An SST-Based Algorithm for the Steiner Problem in Graphs

An Algorithm for Solving Large Capacitated Warehouse Location Problems

A Note on Solving Large P-median Problems

An Algorithm for the Steiner Problem in Graphs

An Algorithm for the Steiner Problem in Graphs

A Genetic Algorithm for the Set Covering Problem

Graph Problems Arising from Wavelength-Routing in All Optical Networks

Graph problems arising from wavelength-routing in all-optical networks

Optimal wavelength-routed multicasting

Mirror descent and nonlinear projected subgradient methods for convex optimization

Global optimality conditions for quadratic optimization problems with binary constraints

A probabilistic result for the max-cut problem on random graphs

Studies in Economics of Transportation

On the Theory of Traffic Flows in Networks

Studies in the Economics of Transportation

On maximal chains

Network planning for xDSL

Enhanced xDSL planning

Controlled Potential Reduction Methods for Linear Programming

MiFi: Managed WiFi for QoS assurance, fairness and high throughput of current IEEE 802.11 networks with multiple access points

Efficient Location Management Based on Moving Location Areas

A cutting plane algorithm for the capacitated arc routing problem

Digital Telephony

An inexact interior point method for monotone NCP

Dynamic Programming

Dynamic Programming

On a routing problem

On a Routing Problem

On a Routing Problem

On a routing problem

Dynamic Programming

A design technique for reliable networks under a nonuniform traffic distribution

Multiple criteria decision analysis: An integrated approach

Optimal placement of add/drop multiplexers: static and dynamic models

Internet routing and related topology issues

A Helly type theorem and semi-infinite programming

Adjustable robust solutions of uncertain linear programs

Optimal Design of Trusses Under a Nonconvex Global Buckling Constraint

Free material design via semidefinite programming: the multiload case with contact conditions

Robust optimization --- methodology and applications

Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications

On polyhedral approximations of the second-order cone

Robust solutions of linear programming problems contaminated with uncertain data

On the quality of SDP approximations of uncertain SDP programs affected by box uncertainty

Robust solutions of uncertain linear programs

On the quality of SDP approximations of uncertain SDP programs

Robust convex optimization

Convex optimization in engineering: Modeling, analysis, algorithms

Potential reduction polynomial time method for truss topology design

A conjugate duality scheme generating a new class of differentiable duals

Hidden convexity in some nonconvex quadratically constrained quadratic programming

Partitioning Procedures for Solving Mixed Integer Variables Programming Problems

Partitioning procedures for solving mixed variables programming problems

Partitioning procedures for solving mixed-variable programming problems

On portfolio selection: Improved covariance matrix estimation for Swedish asset returns

Experiments in Mixed Integer Linear Programming

The efficient solution of large-scale linear programming problems - some algorithmic techniques and computational results

An incremental branch-and-bound method for the satisfiability problem

Global tree optimization: A non-greedy decision tree algorithm

Bilinear separation of two sets in $n$-space

Robust linear programming discrimination of two linearly inseparable sets

Tutorial on Grooming Switches

A parametric optimization method for machine learning

A Comparative Study of Large-Scale Nonlinear Optimization Algorithms

Interior-Point Methods for Nonconvex Nonlinear Programming: Jamming and Comparative Numerical Testing

Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions

Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming

Parallel computing on semidefinite programs

GPCG: A case study in the performance and scalability of optimization algorithms

DSDP4 -- a software package implementing the dual-scaling algorithm for semidefinite programming

Solving large-scale sparse semidefinite programs for combinatorial optimization

Mixed Linear and Semidefinite Programming for Combinatorial and Quadratic Optimization

Radio link frequency assignment project, Technical annex T--2.3.2: Potential reduction methods

The probabilistic set-covering problem

Highway-capacity utilization and investment in transportation corridors

Radio Resource Management in Bunched Personal Communication Systems

Graphs and Hypergraphs

Graphs and hypergraphs

Graphes et Hypergraphes

The Theory of Graphs and its Applications

A tabu search procedure for target-matching in financial scenario generation

Solving multistage stochastic programs using tree dissection

Dimensioning Bandwidth for Elastic Traffic in High-Speed Data Networks

Long-Distance Access Network Design

Power control and adaptive resource allocation in DS-CDMA systems

The Optimal Set and Optimal Partition Approach to Linear and Quadratic Programming

A primal-dual decomposition-based interior point approach to two-stage stochastic linear programming

Basis- and partition Identification for Quadratic Programming and Linear Complementarity Problems

Sensitivity Analysis for Degenerate Quadratic Programming

Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming

Improved approximations for the Steiner tree problem

Improved approximations for the Steiner tree problem

Improved approximations for the Steiner tree problem

On approximation properties of the independent set problem for low degree graphs.

Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio 3

Traffic grooming in unidirectional WDM ring networks using design theory

Faster exact algorithms for Steiner trees in planar networks

The Steiner problem with edge lengths 1 and 2

Two probabilistic results on rectilinear Steiner trees

Solving the nonadditive traffic equilibrium problem

Research Activities on UMTS Radio Interface, Network Architectures, and Planning

Path optimization for graph partitioning problems

Graph Theoretic Models for Multicast Communications

Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic

Reducing Electronic Multiplexing Costs in SONET/WDM Rings with Dynamically Changing Traffic

Grooming dynamic traffic in unidirectional SONET ring networks

Code assignment for hidden terminal interference avoidance in multihop packet radio networks

Linear Network Optimization: Algorithms and Codes

Data Networks

Data Networks

Data Networks

Data Networks

Data networks

RELAX-IV: A faster version of the RELAX code for solving minimum cost flow problems

RELAXT-III: A new and improved version of the RELAX code, Lab. for Information and Decision Systems Report P-1990

Nonlinear Programming

Data Networks

Network Optimization: Continuous and Discrete Models

Network optimization: Continuous and discrete models

Dynamic Programming and Optimal Control, Vol. 1--2

Linear networks optimization: Algorithms and Codes

An Auction Algorithm for shortest paths

The Auction Algorithm: A distributed relaxation method

for the assignment problems

A distributed asynchronous relaxation algorithm for theAssignment Problem

Constrained optimization and Lagrange multiplier methods

Projected Newton methods for optimization problems with simple constraints

A distributed Algorithm for the Assignment Problem

On the Goldstein-Levitin-Polyak gradient projection method

A generic auction algorithm for the minimum costnetwork flow problem

The Auction Algorithm for minimum cost network flowproblem

The Auction Algorithm for transportation problems

Asynchronous Hungarian Methods for the Assignment

Problem

Projected Newton methods and optimization of multicommodity flows

Second derivative algorithms for minimum delay distributed routing in networks

Data networks

Parallel Asynchronous Label Correcting Methods for

Shortest Paths

Polynomial auction algorithms for Shortest Paths

Parallel and distributed computation -- Numerical methods

Dynamic Programming. Deterministic and Stochastic Models

Portfolio construction through mixed-integer programming at Grantham, Mayo, Van Otterloo and Company

On the worst case complexity of potential reduction algorithms for linear programming

A technique for speeding up the solution of the Lagrangean dual

On the relation between option and stock prices: a convex optimization approach

The price of robustness

The price of robustness