Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
From MaRDI portal
Publication:2074672
benchmarking CP-SATconstraint optimizationMIPOMT solverssoft coupled task schedulingtour-dependent edge costsTSP with precedence constraints
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)
Recommendations
- A branch-and-price-and-cut algorithm for the cable-routing problem in solar power plants
- scientific article; zbMATH DE number 1738680
- Precedence constrained TSP arising in printed circuit board assembly
- Fiber cable network design in tree networks
- A TSP (1,2) application arising in cable assembly shops
Cites work
- ``Almost-stable matchings in the hospitals/residents problem with couples
- A dynamic vehicle routing problem with time-dependent travel times
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- An Asymptotic, Probabilistic Analysis of a Routing Problem
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints
- Approximating Capacitated Routing and Delivery Problems
- Automatically improving constraint models in Savile Row
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- Cores in core based MaxSat algorithms: an analysis
- Debugging unsatisfiable constraint models
- Dominance breaking constraints
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- scientific article; zbMATH DE number 3167495 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 1961994 (Why is no real title available?)
- scientific article; zbMATH DE number 2080319 (Why is no real title available?)
- scientific article; zbMATH DE number 947471 (Why is no real title available?)
- scientific article; zbMATH DE number 7453120 (Why is no real title available?)
- scientific article; zbMATH DE number 2243353 (Why is no real title available?)
- Mixed integer programming models for job shop scheduling: A computational analysis
- On converting CNF to DNF
- On SAT Modulo Theories and Optimization Problems
- On the complexity of coupled-task scheduling
- On the maximum acyclic subgraph problem under disjunctive constraints
- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
- Permutation Problems and Channelling Constraints
- Reducibility among combinatorial problems
- Resolution for Max-SAT
- Scheduling coupled-operation jobs with exact time-lags
- Single-machine scheduling with precedence constraints and position-dependent processing times
- Soft car sequencing with colors: lower bounds and optimality proofs
- The maximum flow problem with disjunctive constraints
- The pickup and delivery traveling salesman problem with handling costs
- THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- The traveling salesman problem and its variations.
- Time dependent vehicle routing problem with a multi ant colony system
- Topological sorting of large networks
- Using dual presolving reductions to reformulate cumulative constraints
Cited in
(1)
This page was built for publication: Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074672)
