On the Consistent Path Problem
From MaRDI portal
Publication:5144803
DOI10.1287/opre.2020.1979zbMath1457.90126OpenAlexW3092133097MaRDI QIDQ5144803
No author found.
Publication date: 19 January 2021
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2020.1979
Related Items (2)
Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ A graph-based decomposition method for convex quadratic optimization with indicators
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Decision diagrams for optimization
- Approximation algorithms for discrete polynomial optimization
- The unconstrained binary quadratic programming problem: a survey
- Attacking the market split problem with lattice point enumeration
- Accelerating the cubic regularization of Newton's method on convex problems
- Factoring polynomials with rational coefficients
- A class of valid inequalities for multilinear 0-1 optimization problems
- Global optimality conditions for cubic minimization problem with box or binary constraints
- Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
- Discrete Optimization with Decision Diagrams
- Decomposition Based on Decision Diagrams
- Manipulating MDD Relaxations for Combinatorial Optimization
- Formulation and optimization of cubic polynomial joint trajectories for industrial robots
- Cost-Bounded Binary Decision Diagrams for 0-1 Programming
- Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
- A Class of Hard Small 0-1 Programs
- Decision Diagrams and Dynamic Programming
- Approximation Methods for Polynomial Optimization
- Some optimal inapproximability results
- MDD Propagation for Sequence Constraints
- Experimental and Efficient Algorithms
- A Polyhedral Study of Binary Polynomial Programs
- On the advantage over a random assignment
This page was built for publication: On the Consistent Path Problem
