Optimization by ghost image processes in neural networks
From MaRDI portal
Publication:1342097
DOI10.1016/0305-0548(94)90012-4zbMath0812.90128OpenAlexW2021030211MaRDI QIDQ1342097
Publication date: 11 January 1995
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90012-4
coveringneural networkspackingfixed charge and multidimensional knapsack problemsghost image processes
Combinatorial optimization (90C27) Neural networks for/in biological studies, artificial life and related topics (92B20)
Related Items
An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems, Metaheuristics: A bibliography, An extreme‐point tabu‐search algorithm for fixed‐charge network problems, Multi-start and path relinking methods to deal with multiobjective Knapsack problems, Deterministic job-shop scheduling: Past, present and future, COLE: a new heuristic approach for fixed charge problem computational results, The multiobjective multidimensional knapsack problem: a survey and a new approach, Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
Uses Software
Cites Work
- Unnamed Item
- ``Neural computation of decisions in optimization problems
- Tabu search techniques. A tutorial and an application to neural networks
- A connectionist approach to the quadratic assignment problem
- Self-organization and associative memory.
- Future paths for integer programming and links to artificial intelligence
- A user's guide to tabu search
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A Greedy Heuristic for the Set-Covering Problem
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
