Future paths for integer programming and links to artificial intelligence

DOI10.1016/0305-0548(86)90048-1zbMath0615.90083DBLPjournals/cor/Glover86OpenAlexW2084792706WikidataQ55934114 ScholiaQ55934114MaRDI QIDQ1821034

Fred Glover

Publication date: 1986

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(86)90048-1

zbMATH Keywords

tabu searchartificial intelligencelearning strategiescontrolled randomizationinduced decomposition

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (only showing first 100 items - show all)

Optimization strategies for two-mode partitioning ⋮ ARMS: an automated resource management system for British telecommunications plc ⋮ Modeling reverse logistic tasks within closed-loop supply chains: an example from the automotive industry ⋮ A novel two-stage framework for reducing ergonomic risks of a mixed-model parallel U-shaped assembly-line ⋮ New simple and efficient heuristics for the uncapacitated single allocation hub location problem ⋮ The discrete time/cost trade-off problem: Extensions and heuristic procedures ⋮ Graph colouring approaches for a satellite range scheduling problem ⋮ On-line decision support for take-off runway scheduling with uncertain taxi times at London heathrow airport ⋮ A comparison of five heuristics for the multiple depot vehicle scheduling problem ⋮ An information theoretic approach to pedigree reconstruction ⋮ Classification of applied methods of combinatorial optimization ⋮ Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics ⋮ Joint optimal determination of process mean, production quantity, pricing, and market segmentation with demand leakage ⋮ The vehicle-routing problem with time windows and driver-specific times ⋮ Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) ⋮ Eidetic wolf search algorithm with a global memory structure ⋮ The service allocation problem at the Gioia Tauro maritime terminal ⋮ Developing effective meta-heuristics for a probabilistic location model via experimental design ⋮ Topological dynamics characterization for LEO satellite networks ⋮ Minimising maximum response time ⋮ Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks ⋮ Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex ⋮ Two approaches for solving the buffer allocation problem in unreliable production lines ⋮ A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling ⋮ A GRASP metaheuristic for microarray data analysis ⋮ Location-arc routing problem: heuristic approaches and test instances ⋮ Minimizing the total completion time in a distributed two stage assembly system with setup times ⋮ Solution method for the location planning problem of logistics park with variable capacity ⋮ A new heuristic for solving the \(p\)-median problem in the plane ⋮ A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem ⋮ Algorithmic aspects for multiple-choice hardware/software partitioning ⋮ A leader-follower model for discrete competitive facility location ⋮ The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques ⋮ Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling ⋮ Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements ⋮ A tabu search approach for solving a difficult forest harvesting machine location problem ⋮ The gravity \(p\)-median model ⋮ A hybrid meta-heuristic for the batching problem in just-in-time flow shops ⋮ A bicriteria flowshop scheduling problem with setup times ⋮ General solutions to the single vehicle routing problem with pickups and deliveries ⋮ Designing delivery districts for the vehicle routing problem with stochastic demands ⋮ Stochastic automated search methods in cellular automata: The discovery of tens of thousands of glider guns ⋮ Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem ⋮ A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem ⋮ The gravity multiple server location problem ⋮ A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem ⋮ An iterative clustering approach based on material flow requirements for cellular designs ⋮ Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery ⋮ A heuristic method for non-homogeneous redundancy optimization of series-parallel multi-state systems ⋮ Multipath adaptive tabu search for a vehicle control problem ⋮ Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem ⋮ New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem ⋮ A benchmark library and a comparison of heuristic methods for the linear ordering problem ⋮ Compact normal forms in propositional logic and integer programming formulations ⋮ Similarities between meta-heuristics algorithms and the science of life ⋮ A network-related nuclear power plant model with an intelligent branch- and-bound solution approach ⋮ An algorithmic construction of \(E(s^2)\)-optimal supersaturated designs ⋮ Advanced particle swarm assisted genetic algorithm for constrained optimization problems ⋮ A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm ⋮ Local search heuristics for the probabilistic dial-a-ride problem ⋮ A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations ⋮ Optimal configuration selection for reconfigurable manufacturing systems ⋮ Modelling the dynamics of stochastic local search on \(k\)-SAT ⋮ Tabu search for attribute reduction in rough set theory ⋮ Soft car sequencing with colors: lower bounds and optimality proofs ⋮ A tabu search heuristic for the generalized minimum spanning tree problem ⋮ The maximin gradual cover location problem ⋮ Hybrid particle swarm optimization and tabu search approach for selecting genes for tumor classification using gene expression data ⋮ Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system ⋮ Essential particle swarm optimization queen with tabu search for MKP resolution ⋮ A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks ⋮ Solving mesh router nodes placement problem in wireless mesh networks by tabu search algorithm ⋮ A survey on optimization metaheuristics ⋮ Unrelated parallel machine scheduling -- perspectives and progress ⋮ Fuzzy job-shop scheduling problems: a review ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem ⋮ A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria ⋮ Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem ⋮ Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs ⋮ Developing equilibrium optimization methods for hub location problems ⋮ Hybrid evolutionary algorithm for the b-chromatic number ⋮ Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP ⋮ A fixed point operator for the generalised maximum satisfiability problem ⋮ Tabu search -- uncharted domains ⋮ Pseudo-Boolean optimization ⋮ On solving the forward kinematics of 3RPR planar parallel manipulator using hybrid metaheuristics ⋮ Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search ⋮ A two-phase hybrid metaheuristic for the vehicle routing problem with time windows ⋮ A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem ⋮ Using tabu search techniques for graph coloring ⋮ Identifying sets of key players in a social network ⋮ Construction and improvement algorithms for dispersion problems ⋮ TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph ⋮ Algorithms for the maximum satisfiability problem ⋮ Tabu search for large scale timetabling problems ⋮ A convoy scheduling problem ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects ⋮ Metaheuristics in combinatorial optimization ⋮ On multiobjective selection for multimodal optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Constructive characterizations of the value-function of a mixed-integer program. I
• Solving embedded generalized network problems
• Reoptimization procedures for bounded variable primal simplex network algorithms
• Generalization of Murty's direct algorithm to linear and convex quadratic programming
• The equal flow problem
• Layering strategies for creating exploitable structure in linear and integer programs
• Optimization with disjunctive constraints
• Foundations of optimization
• Studies in integer programming. Based on material presented at the workshop on integer programming, Bonn, 8-12 September 1975
• Integer and mixed-integer programming models: General properties
• Cluster Analysis: An Application of Lagrangian Relaxation
• A mixed-integer programming approach to the clustering problem
• Experimental Results on the New Techniques for Integer Programming Formulations
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Extracting embedded generalized networks from linear programming problems
• Solving Large-Scale Zero-One Linear Programming Problems
• Computational comparison of two solution procedures for allocation/processing networks
• A Primal Simplex Approach to Pure Processing Networks
• An Almost Linear-Time Algorithm for Graph Realization
• Some relationships between lagrangian and surrogate duality in integer programming
• Converting Linear Programs to Network Problems
• Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks
• Integer Programming Solution of a Classification Problem
• Coefficient reduction for inequalities in 0–1 variables
• Multicommodity Distribution System Design by Benders Decomposition
• Facet of regular 0–1 polytopes
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• Note—On the Use of Fictitious Bounds in Tree Search Algorithms
• Covering, Packing and Knapsack Problems
• Disjunctive Programming
• Validation of subgradient optimization
• Equation of State Calculations by Fast Computing Machines
• Computer Solutions of the Traveling Salesman Problem
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• A man-machine approach toward solving the traveling salesman problem
• Cluster Analysis and Mathematical Programming
• Algorithms for Large-scale Travelling Salesman Problems
• Investigation of some branch and bound strategies for the solution of mixed integer linear programs
• Aggregation of Variables in Dynamic Systems

This page was built for publication: Future paths for integer programming and links to artificial intelligence