Layered graph approaches for combinatorial optimization problems
type: Item
instance of: scholarly article
title: Layered graph approaches for combinatorial optimization problems
zbMATH Open document ID: 1458.90612
author: Markus Leitner
author: Mario Ruthmair
author: Luis Gouveia
published in: Computers \& Operations Research
publication date: 2018-12-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6988141
zbMATH Keywords: layered graphs
zbMATH Keywords: integer programming
zbMATH Keywords: extended formulations
zbMATH Keywords: reformulation techniques
zbMATH Keywords: decomposition methods
describes a project that uses: stprbh
MaRDI profile type: Publication
full work available at URL: j.cor.2018.09.007
OpenAlex ID: W2890623929
cites work: The time dependent traveling salesman problem: polyhedra and algorithm
cites work: On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
cites work: The \(k\) edge-disjoint 3-hop-constrained paths polytope
cites work: Time-indexed formulations and the total weighted tardiness problem
cites work: A bucket indexed formulation for nonpreemptive single machine scheduling problems
cites work: The Continuous-Time Service Network Design Problem
cites work: On the hop-constrained survivable network design problem with reliable edges
cites work: Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
cites work: Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: A time bucket formulation for the traveling salesman problem with time windows
cites work: Extended formulation for hop constrained distribution network configuration problems
cites work: Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
cites work: Dynamic graph generation for the shortest path problem in time expanded networks
cites work: Thinning out Steiner trees: a node-based model for uniform edge costs
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: Quickest Flows Over Time
cites work: Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
cites work: Combined route capacity and route length models for unit demand vehicle routing problems
cites work: Natural and extended formulations for the time-dependent traveling salesman problem
cites work: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
cites work: Hop constrained Steiner trees with multiple root nodes
cites work: The two-level diameter constrained spanning tree problem
cites work: Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
cites work: Modeling and solving the rooted distance-constrained minimum spanning tree problem
cites work: Hop-constrained node survivable network design: An application to MPLS over WDM
cites work: Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models
cites work: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
cites work: Load-dependent and precedence-based models for pickup and delivery problems
cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
cites work: Two exact algorithms for the distance-constrained vehicle routing problem
cites work: Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
cites work: Decomposition methods for the two-stage stochastic Steiner tree problem
cites work: A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems
cites work: An algorithmic framework for the exact solution of tree-star problems
cites work: Projection results for vehicle routing
cites work: Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
cites work: Hop‐level flow formulation for the survivable network design with hop constraints problem
cites work: A comparative analysis of several asymmetric traveling salesman problem formulations
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem
cites work: A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
cites work: Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems
cites work: On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem
cites work: A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
cites work: Q3109941
cites work: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
cites work: Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
cites work: Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
cites work: A dual ascent approach for steiner tree problems on a directed graph
Wikidata QID: Q129208090
DOI: 10.1016/J.COR.2018.09.007
Recommended article: Layered graphs: applications and algorithms
Recommended article: Graphical approach to combinatorial optimization
Recommended article: A Generalization of the Directed Graph Layering Problem
Recommended article: Q4667215

Layered graph approaches for combinatorial optimization problems (Recommended article)
Recommended article: Deriving a class of layer-oriented graph algorithms
Similarity Score: 0.8993329
Recommender Run: Recommender Run 3

Layered graph approaches for combinatorial optimization problems (Recommended article)
Recommended article: Competitive Algorithms for Layered Graph Traversal
Similarity Score: 0.89391
Recommender Run: Recommender Run 3

Layered graph approaches for combinatorial optimization problems (Recommended article)
Recommended article: Q4422266
Similarity Score: 0.89323974
Recommender Run: Recommender Run 3

Layered graph approaches for combinatorial optimization problems (Recommended article)
Recommended article: Q4890614
Similarity Score: 0.89031106
Recommender Run: Recommender Run 3

Layered graph approaches for combinatorial optimization problems (Recommended article)
Recommended article: Combinatorial Optimization and Graph Algorithms
Similarity Score: 0.8891948
Recommender Run: Recommender Run 3

Layered graph approaches for combinatorial optimization problems (Recommended article)
Recommended article: Graphical method to solve combinatorial optimization problems
Similarity Score: 0.8857832
Recommender Run: Recommender Run 3