Future paths for integer programming and links to artificial intelligence
Explore this paper's citation graph
Summary
Four key areas of Integer programming are examined from a framework that links the perspectives of artificial intelligence and operations research, and each has characteristics that appear usefully relevant to developments on the horizon.
- Type
- article
- Published
- 1986-05-01
- Cited by
- 4,528
- References
- 92
- OpenAlex
- https://openalex.org/W2084792706
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:13630957
Keywords
Integer programming, Tabu search, Computer science, Key (lock), Decomposition
References
- IMPROVED COMPUTER-BASED PLANNING TECHNIQUES
- Computer-assisted analysis and model simplification
- Foundations of Optimization.
- Optimization with disjunctive constraints
- Heuristics : intelligent search strategies for computer problem solving
- Facet of regular 0–1 polytopes
- The general employee scheduling problem. An integration of MS and AI
- Solving embedded generalized network problems
- Some relationships between lagrangian and surrogate duality in integer programming
- Disjunctive programming and a hierarchy of relaxations for discrete optimization problems
- Integer Programming Solution of a Classification Problem
- Cluster Analysis and Mathematical Programming
- Using simulated annealing to solve routing and location problems
- Algorithms for Large-scale Travelling Salesman Problems
- A man-machine approach toward solving the traveling salesman problem
- Studies in Integer Programming
- Interactive decision software and computer graphics for architectural and space planning
- Coefficient reduction for inequalities in 0–1 variables
- Extracting embedded generalized networks from linear programming problems
- Converting Linear Programs to Network Problems
Cited by
- Metaheurísticas de optimización combinatoria: uso de Simulated Annealing para un problema de calendarización
- Ambulance routing problems with rich constraints and multiple objectives
- Ant Colony Optimisation for vehicle routing problems: from theory to applications.
- Algorithmes métaheuristiques hybrides pour la sélection de gènes et la classification de données de biopuces. (Hybrid metaheuristics algorithms for gene selection and classification of microarray data)
- Modélisation et Optimisation d’un Système de Transport à la Demande Multicritère et Dynamique
- Abordagens heurísticas para o planeamento de rotas e carregamento de veículos
- Design of a selective parallel heuristic algorithm for the vehicle routing problem on an adaptive object model
- Evolutionary Search for Cellular Automata Logic Gates with Collision-Based Computing
- A hybrid algorithm with diversification and intensification for permutation flow shop scheduling
- Algorithms for sequence-based reverse metabolic engineering
- Constructing Covering Arrays using Parallel Computing and Grid Computing
- A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem
- Résolution de problèmes de satisfaction de contraintes avec des algorithmes évolutionnistes
- A bi-objective integer programming model for partly-restricted flight departure scheduling
- Real time traffic management in junction areas and bottleneck sections on mainline railways
- A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows
- Solving Combinatorial Optimization Problems Using Genetic Algorithms and Ant Colony Optimization
- Modeling Transportation Problems Using Concepts of Swarm Intelligence and Soft Computing
- Tabu search for the BWC problem
- Lot streaming and batch scheduling: splitting and grouping jobs to improve production efficiency
Related papers
- An efficient tabu search for solving the uncapacitated single allocation hub location problem
- Tabu Search metaheuristics for global optimization of electromagnetic problems
- Tabu Search: Its Modified Forms and Management Agent
- Differences between real and integer production possibility sets in data envelopment analysis
- Finding integer efficient solutions for multiple objective network programming problems
- A reference direction approach to multiple objective integer linear programming
- On the existence of optimal solutions to integer and mixed-integer programming problems
- A Comment on Theory of Integer-Valued Data Envelopment Analysis
- Integer programming: enumeration - complete and implicit
- Symmetries in Integer Programs