Algorithm for solving the Discrete-Continuous Inspection Problem
From MaRDI portal
Publication:5150054
DOI10.24425/ACS.2020.135845zbMath1459.90179OpenAlexW4384935437MaRDI QIDQ5150054
Wojciech Bożejko, Radosław Grymin, Mieczyslaw Wodecki, Zenon Chaczko, Jaroslaw Pempera
Publication date: 9 February 2021
Published in: Archives of Control Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.24425/acs.2020.135845
Uses Software
Cites Work
- A random-key genetic algorithm for the generalized traveling salesman problem
- Parallel Tabu Search Algorithm with Uncertain Data for the Flexible Job Shop Problem
- A Limited Memory Algorithm for Bound Constrained Optimization
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- A Method for Solving Traveling-Salesman Problems
- A Simplex Method for Function Minimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algorithm for solving the Discrete-Continuous Inspection Problem