scientific article; zbMATH DE number 7378671
From MaRDI portal
Publication:5009558
DOI10.4230/LIPIcs.ESA.2018.1MaRDI QIDQ5009558
Laura Sanità, Umang Bhaskar, Sara Ahmadian, Chaitanya Swamy
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear programmingcombinatorial optimizationshortest pathsapproximation algorithmsinverse optimizationpolyhedral theory
Related Items (3)
Inverse integer optimization with multiple observations ⋮ Inverse optimization problems with multiple weight functions ⋮ An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stable routing under the Spanning Tree Protocol
- The negative cycles polyhedron and hardness of checking some polyhedral properties
- On an instance of the inverse shortest paths problem
- The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
- Primal-dual methods for vertex and facet enumeration
- Inverse problem of minimum cuts
- A further study on inverse linear programming problems
- Solution structure of some inverse combinatorial optimization problems
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Efficient enumeration of the vertices of polyhedra associated with network LP's
- A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm
- Inverse conic programming with applications
- Inverse combinatorial optimization: a survey on problems, methods, and results
- An inverse problem of the weighted shortest path problem
- Calculating some inverse linear programming problems
- Complexity of Inverse Shortest Path Routing
- The Complexity of Vertex Enumeration Methods
- Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
- Inverse Optimization
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Internet Routing and Related Topology Issues
- Inverse Problem Theory and Methods for Model Parameter Estimation
- Stable Routing and Unique-Max Coloring on Trees
This page was built for publication:
