Future paths for integer programming and links to artificial intelligence
type: Item
instance of: scholarly article
title: Future paths for integer programming and links to artificial intelligence
zbMATH Open document ID: 0615.90083
DOI: 10.1016/0305-0548(86)90048-1
author: Fred Glover
published in: Computers \& Operations Research
publication date: 1986-01-01T00:00:00Z
review text: Integer programming has benefited from many innovations in models and methods. Some of the promising directions for elaborating these innovations in the future may be viewed from a framework that links the perspectives of artificial intelligence and operations research. To demonstrate this, four key areas are examined: (1) controlled randomization, (2) learning strategies, (3) induced decomposition and (4) tabu search. Each of these is shown to have characteristics that appear usefully relevant to developments on the horizon.
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 3997561
zbMATH Keywords: artificial intelligence
zbMATH Keywords: controlled randomization
zbMATH Keywords: learning strategies
zbMATH Keywords: induced decomposition
zbMATH Keywords: tabu search
Wikidata QID: Q55934114
MaRDI profile type: Publication
full work available at URL: 0305-0548(86)90048-1
OpenAlex ID: W2084792706
cites work: Q3214706
cites work: Q4130999
cites work: Q4739657
cites work: Q5638112
cites work: Q4082544
cites work: Optimization with disjunctive constraints
cites work: Disjunctive Programming
cites work: Coefficient reduction for inequalities in 0–1 variables
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Q3048578
cites work: Covering, Packing and Knapsack Problems
cites work: Technical Note—Facets and Strong Valid Inequalities for Integer Programs
cites work: Foundations of optimization
cites work: Q4178782
cites work: Validation of subgradient optimization
cites work: Some relationships between lagrangian and surrogate duality in integer programming
cites work: Q5630824
cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
cites work: Multicommodity Distribution System Design by Benders Decomposition
cites work: Cluster Analysis: An Application of Lagrangian Relaxation
cites work: Q4120330
cites work: Q4132247
cites work: Constructive characterizations of the value-function of a mixed-integer program. I
cites work: Experimental Results on the New Techniques for Integer Programming Formulations
cites work: Integer and mixed-integer programming models: General properties
cites work: Q3959807
cites work: Optimization by Simulated Annealing
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: Q3720323
cites work: A man-machine approach toward solving the traveling salesman problem
cites work: Q3677509
cites work: Note—On the Use of Fictitious Bounds in Tree Search Algorithms
cites work: Generalization of Murty's direct algorithm to linear and convex quadratic programming
cites work: Investigation of some branch and bound strategies for the solution of mixed integer linear programs
cites work: Q4747542
cites work: Q3856120
cites work: Q3732977
cites work: Q3844775
cites work: Q4144754
cites work: Aggregation of Variables in Dynamic Systems
cites work: Q3330988
cites work: Converting Linear Programs to Network Problems
cites work: An Almost Linear-Time Algorithm for Graph Realization
cites work: Extracting embedded generalized networks from linear programming problems
cites work: Reoptimization procedures for bounded variable primal simplex network algorithms
cites work: The equal flow problem
cites work: A Primal Simplex Approach to Pure Processing Networks
cites work: Computational comparison of two solution procedures for allocation/processing networks
cites work: Solving embedded generalized network problems
cites work: Q3730336
cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
cites work: Studies in integer programming. Based on material presented at the workshop on integer programming, Bonn, 8-12 September 1975
cites work: Facet of regular 0–1 polytopes
cites work: Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks
cites work: Layering strategies for creating exploitable structure in linear and integer programs
cites work: Q3341651
cites work: A mixed-integer programming approach to the clustering problem
cites work: Integer Programming Solution of a Classification Problem
cites work: Cluster Analysis and Mathematical Programming

Future paths for integer programming and links to artificial intelligence (cites work)
cites work: Q4165152

Future paths for integer programming and links to artificial intelligence (cites work)
cites work: Algorithms for Large-scale Travelling Salesman Problems

Future paths for integer programming and links to artificial intelligence (DBLP publication ID)
DBLP publication ID: journals/cor/Glover86

Future paths for integer programming and links to artificial intelligence (Recommended article)
Recommended article: Progress in Academic Computational Integer Programming
Similarity Score: 0.8687095
Recommender Run: Recommender Run 3

Future paths for integer programming and links to artificial intelligence (Recommended article)
Recommended article: Integer programming as a framework for optimization and approximability
Similarity Score: 0.8627807
Recommender Run: Recommender Run 3

Future paths for integer programming and links to artificial intelligence (Recommended article)
Recommended article: Evolution and state-of-the-art in integer programming
Similarity Score: 0.85737497
Recommender Run: Recommender Run 3

Future paths for integer programming and links to artificial intelligence (Recommended article)
Recommended article: Artificial intelligence problems and combinatorial optimization
Similarity Score: 0.85118604
Recommender Run: Recommender Run 3

Future paths for integer programming and links to artificial intelligence (Recommended article)
Recommended article: An intelligent algorithm for mixed-integer programming models
Similarity Score: 0.8506798
Recommender Run: Recommender Run 3

Future paths for integer programming and links to artificial intelligence (Recommended article)
Recommended article: Theory and Applications of n-Fold Integer Programming
Similarity Score: 0.8494487
Recommender Run: Recommender Run 3

Future paths for integer programming and links to artificial intelligence (Recommended article)
Recommended article: Recent advances in integer programming
Similarity Score: 0.8485546
Recommender Run: Recommender Run 3

Future paths for integer programming and links to artificial intelligence (Recommended article)
Recommended article: Q4340910
Similarity Score: 0.8467298
Recommender Run: Recommender Run 3