Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms
DOI10.1134/s0965542524700441zbMATH Open1545.90028MaRDI QIDQ6588151
Daniil Mikhaĭlovich Khachaĭ, Yu. Yu. Ogorodnikov, Mikhail Yu. Khachay, R. A. Rudakov
Publication date: 15 August 2024
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
branch-and-bound methodadaptive large neighborhood search heuristicMILP-modelreliable production process design problem
Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Production models (90B30)
Cites Work
- New formulations for the elementary shortest-path problem visiting a given set of nodes
- The constrained shortest path tour problem
- The directed subgraph homeomorphism problem
- The Euclidean traveling salesman problem is NP-complete
- The disjoint shortest paths problem
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Approximation schemes for the generalized traveling salesman problem
- Branch-and-bound for the precedence constrained generalized traveling salesman problem
- Constrained shortest path tour problem: branch-and-price algorithm
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
- The traveling salesman problem and its variations.
- An exact algorithm with linear complexity for a problem of visiting megalopolises
- PCGLNS: a heuristic solver for the precedence constrained generalized traveling salesman problem
- Branch-and-Bound Strategies for Dynamic Programming
- An efficient exact approach for the constrained shortest path tour problem
- The Routing Problem with “K” Specified Nodes
- Handbook of metaheuristics
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
- Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem
This page was built for publication: Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms
