On the consistent path problem

DOI10.1287/OPRE.2020.1979MaRDI QIDQ5144803zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

algorithmsinteger programminggeneralized networksflow algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• Discrete optimization with decision diagrams
• Theoretical insights and algorithmic tools for decision diagram-based optimization
• Target cuts from relaxed decision diagrams
• Decision diagrams and dynamic programming
• Decomposition based on decision diagrams

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1342116 (Why is no real title available?)
• A Class of Hard Small 0-1 Programs
• A class of valid inequalities for multilinear 0-1 optimization problems
• A polyhedral study of binary polynomial programs
• Accelerating the cubic regularization of Newton's method on convex problems
• Approximation Methods for Polynomial Optimization
• Approximation algorithms for discrete polynomial optimization
• Attacking the market split problem with lattice point enumeration
• Cost-Bounded Binary Decision Diagrams for 0-1 Programming
• Decision diagrams and dynamic programming
• Decision diagrams for optimization
• Decomposition based on decision diagrams
• Discrete optimization with decision diagrams
• Experimental and Efficient Algorithms
• Factoring polynomials with rational coefficients
• Formulation and optimization of cubic polynomial joint trajectories for industrial robots
• Global optimality conditions for cubic minimization problem with box or binary constraints
• MDD propagation for sequence constraints
• Manipulating MDD relaxations for combinatorial optimization
• Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
• On the advantage over a random assignment
• Solving a system of linear Diophantine equations with lower and upper bounds on the variables.
• Some optimal inapproximability results
• The unconstrained binary quadratic programming problem: a survey

Cited in

(4)

• A graph-based decomposition method for convex quadratic optimization with indicators
• On the Euclidean two paths problem
• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
• Revisiting restricted path consistency

Describes a project that uses

Uses Software

• CPLEX
• MIPLIB
• BARON

This page was built for publication: On the consistent path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144803)