Layered graph approaches for combinatorial optimization problems
From MaRDI portal
Recommendations
- Layered graphs: applications and algorithms
- Graphical approach to combinatorial optimization
- A generalization of the directed graph layering problem
- scientific article; zbMATH DE number 2159270
- Deriving a class of layer-oriented graph algorithms
- Competitive Algorithms for Layered Graph Traversal
- scientific article; zbMATH DE number 1974111
- scientific article; zbMATH DE number 919758
- Combinatorial optimization and graph algorithms. Communications of NII Shonan meetings
- Graphical method to solve combinatorial optimization problems
Cites work
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A bucket indexed formulation for nonpreemptive single machine scheduling problems
- A comparative analysis of several asymmetric traveling salesman problem formulations
- A dual ascent approach for steiner tree problems on a directed graph
- A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
- A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- A time bucket formulation for the traveling salesman problem with time windows
- An algorithmic framework for the exact solution of tree-star problems
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
- Combined route capacity and route length models for unit demand vehicle routing problems
- Cuts over extended formulations by flow discretization
- Decomposition methods for the two-stage stochastic Steiner tree problem
- Dynamic graph generation for the shortest path problem in time expanded networks
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Extended formulation for hop constrained distribution network configuration problems
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
- Hop constrained Steiner trees with multiple root nodes
- Hop-constrained node survivable network design: An application to MPLS over WDM
- Hop-level flow formulation for the survivable network design with hop constraints problem
- Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
- Load-dependent and precedence-based models for pickup and delivery problems
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models
- Natural and extended formulations for the time-dependent traveling salesman problem
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- On solving the rooted delay- and delay-variation-constrained Steiner tree problem
- On the hop-constrained survivable network design problem with reliable edges
- Projection results for vehicle routing
- Quickest Flows Over Time
- Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- The k edge-disjoint 3-hop-constrained paths polytope
- The Continuous-Time Service Network Design Problem
- The time dependent traveling salesman problem: polyhedra and algorithm
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- The two-level diameter constrained spanning tree problem
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Time-indexed formulations and the total weighted tardiness problem
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Two exact algorithms for the distance-constrained vehicle routing problem
Cited in
(17)- Perspectives on integer programming for time-dependent models
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- Branch-and-refine for solving time-expanded MILP formulations
- Linearized formulations for failure aware barter exchange
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Minimum cost noncrossing flow problem on layered networks
- Performance-driven layer assignment by integer linear programming and path-constrained hypergraph partitioning
- Graphical method to solve combinatorial optimization problems
- Formulations for the clustered traveling salesman problem with d-relaxed priority rule
- A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints
- Solving Steiner trees: Recent advances, challenges, and perspectives
- The travelling salesman problem with positional consistency constraints: an application to healthcare services
- A computational study on integer programming formulations for hop-constrained survivable network design
- Layered graph models for the electric vehicle routing problem with nonlinear charging functions
- Multilist layering: Complexity and applications
- Resource-robust valid inequalities for vehicle routing and related problems
- Multistage graph problems on a global budget
This page was built for publication: Layered graph approaches for combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1628112)
