Future paths for integer programming and links to artificial intelligence

Computers and Operations Research

Volumn 13, Issue 5, 1986, Pages 533-549

  Glover, Fred ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - HEURISTIC; PROBABILITY - RANDOM PROCESSES;

CONTROLLED RANDOMIZATION; INDUCED DECOMPOSITION; INTEGER PROGRAMMING; LEARNING STRATEGIES; TABU SEARCH;

MATHEMATICAL PROGRAMMING;

EID: 0022865373     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(86)90048-1     Document Type: Article

References (96)

1. Optimization with Disjunctive Constraints
2. Disjunctive programming
3. Coefficient reduction for inequalities in 0–1 variables
4. Solving large scale 0–1 linear programming problems
5. Propagation, penalty improvement and use of logical inequalities
6. Covering packing and knapsack problems
7. A software system for mixed integer programming by reformulating automatically using cuts. Talk at session TA7
8. Facets and strong valid inequalities for integer programs
9. Disjunctive programming and a hierarch of relaxations for discrete optimization problems
10. Lagrangean relaxation for integer programming
11. Validation of subgradient optimization
12. Some relationships between Lagrangian and surrogate duality in integer programming
13. A computerized vehicle routing application
14. Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
15. Multicommidity distribution system design by benders decomposition
16. Integrating modeling, algorithm design and computational implementation to solve a large scale nonlinear mixed integer problem
17. Cluster analysis an application of Lagrangian relaxation
18. Disjunctive programming: cutting-planes from logical conditions
19. Cutting-plane theory: disjunctive methods
20. Integer and mixed-integer programming models: general properties
21. Improved computer-based planning techniques
22. A netform system for resource planning in the US Bureau of Land Management
23. A new approach to analyze information contained in a model
24. The general employee scheduling problem an integration of MS and AI
25. Presented at the 12th International Symposium on Mathematical Programming
26. Optimization by simulated annealing
27. Equation of state calculations by fast computing machines
28. Using simulated annealing to solve routing and location problems
29. Computer solutions to the traveling salesman problem
30. The empirical analysis of TSP heuristics
31. A man-machine approach toward solving the traveling salesman problem
32. Heuristics for integer programming using surrogate constraints
33. Practical aspects of integer linear programming
34. On the use of fictitious bounds in tree search algorithms
35. Parametric branch and bound
36. Dynamic Strategies for branch and bound
37. Adaptive estimates improve binary programming
38. Using a posteriori bounds to improve the performance of branch-and-bound algorithms
39. Investigation of some branch-and-bound strategies for the solution of mixed-integer programs
40. Aggregation of variables in dynamic systems
41. Recent algorithms for two versions of graph realization and remarks on applications to linear programming
42. Converting linear programs to network problems
43. An almost linear-time algorithm for graph realization
44. Extracting embedded generalized networks from linear programming problems
45. On hidden structures in linear programs
46. How to detect hidden networks and totally-unimodular subsections of linear programs
47. Reoptimization procedures for bounded variable primal simplex network algorithms
48. The equal flow problem
49. A primal simplex approach to pure processing networks
50. Solving generalized processing network problems
51. Solving embedded generalized network problems
52. A multiphase-dual algorithm for the zero-one integer programming problem
53. Facets of regular 0–1 polytopes
54. Equivalence of the 0–1 integer programming problem to discrete generalized and pure networks
55. Stopped simplex algorithm for the set partitioning problem with transportation-like subproblems
56. Layering strategies of creating exploitable structure in linear and integer programs
57. Lagrangean decomposition: an improvement over Lagragean and surrogate duals
58. Interactive decision software and computer graphics for architectural and space planning
59. An approach to linear programming with 0–1 variables
60. A heuristic for general integer programming
61. An experimental comparison of statistical and linear programming approaches to the discriminant problem
62. Integer programming solution of a classification problem
63. Cluster analysis and mathematical programming
64. Algorithm for large scale TSP's