Future paths for integer programming and links to artificial intelligence
From MaRDI portal
Publication:1821034
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.
Recommendations
- Progress in Academic computational integer programming
- Integer programming as a framework for optimization and approximability
- Evolution and state-of-the-art in integer programming
- Artificial intelligence problems and combinatorial optimization
- An intelligent algorithm for mixed-integer programming models
- Theory and Applications of n-Fold Integer Programming
- Recent advances in integer programming
- scientific article; zbMATH DE number 1021641
Cites work
- A man-machine approach toward solving the traveling salesman problem
- A mixed-integer programming approach to the clustering problem
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- A Primal Simplex Approach to Pure Processing Networks
- Aggregation of Variables in Dynamic Systems
- Algorithms for Large-scale Travelling Salesman Problems
- An Almost Linear-Time Algorithm for Graph Realization
- Cluster Analysis and Mathematical Programming
- Cluster Analysis: An Application of Lagrangian Relaxation
- Coefficient reduction for inequalities in 0–1 variables
- Computational comparison of two solution procedures for allocation/processing networks
- Computer Solutions of the Traveling Salesman Problem
- Constructive characterizations of the value-function of a mixed-integer program. I
- Converting Linear Programs to Network Problems
- Covering, Packing and Knapsack Problems
- Disjunctive Programming
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Equation of state calculations by fast computing machines
- Experimental Results on the New Techniques for Integer Programming Formulations
- Extracting embedded generalized networks from linear programming problems
- Facet of regular 0–1 polytopes
- Foundations of optimization
- Generalization of Murty's direct algorithm to linear and convex quadratic programming
- scientific article; zbMATH DE number 3643032 (Why is no real title available?)
- scientific article; zbMATH DE number 3427118 (Why is no real title available?)
- scientific article; zbMATH DE number 3862960 (Why is no real title available?)
- scientific article; zbMATH DE number 3876377 (Why is no real title available?)
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 3950233 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 3965458 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3657150 (Why is no real title available?)
- scientific article; zbMATH DE number 3781005 (Why is no real title available?)
- scientific article; zbMATH DE number 3501240 (Why is no real title available?)
- scientific article; zbMATH DE number 3545380 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 3559278 (Why is no real title available?)
- scientific article; zbMATH DE number 3574935 (Why is no real title available?)
- scientific article; zbMATH DE number 3598222 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3804893 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Integer and mixed-integer programming models: General properties
- Integer Programming Solution of a Classification Problem
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs
- Layering strategies for creating exploitable structure in linear and integer programs
- Multicommodity Distribution System Design by Benders Decomposition
- Note—On the Use of Fictitious Bounds in Tree Search Algorithms
- Optimization by simulated annealing
- Optimization with disjunctive constraints
- Reoptimization procedures for bounded variable primal simplex network algorithms
- Solving embedded generalized network problems
- Solving Large-Scale Zero-One Linear Programming Problems
- Some relationships between lagrangian and surrogate duality in integer programming
- Studies in integer programming. Based on material presented at the workshop on integer programming, Bonn, 8-12 September 1975
- Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- The equal flow problem
- Validation of subgradient optimization
Cited in
(only showing first 100 items - show all)- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries
- Allocation search methods for a generalized class of location-allocation problems
- A survey on metaheuristics for stochastic combinatorial optimization
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- Optimal location with equitable loads
- The multiple server center location problem
- Competitive facility location on decentralized supply chains
- A hybrid evolution strategy for the open vehicle routing problem
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- A tabu search algorithm for scheduling pharmaceutical packaging operations
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
- Solving a manpower scheduling problem for airline catering using metaheuristics
- Hybridizing exact methods and metaheuristics: a taxonomy
- Heuristics for the dynamic facility layout problem with unequal-area departments
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- A new heuristic method for the flow shop sequencing problem
- Tabu search techniques. A tutorial and an application to neural networks
- A comparison of stochastic scheduling rules for maximizing project net present value
- Exchanges procedures for timetabling problems
- Finding a feasible course schedule using Tabu search
- Location and sizing of offshore platforms for oil exploration
- Restricted neighborhood in the tabu search for the flowshop problem
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Optimizing tabu list size for the traveling salesman problem
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- General local search methods
- An efficient tabu search procedure for the p-median problem
- Planning models for freight transportation
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization
- Fuzzy sets and operations research: Perspectives
- A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
- Heuristic concentration and tabu search: A head to head comparison
- Nonlinear integer programming by Darwin and Boltzmann mixed strategy
- An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- Large-scale layout of facilities using a heuristic hybrid algorithm
- A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits
- Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems
- Using the tabu search method for the distribution of supplies in a hospital
- Unrelated parallel machine scheduling using local search
- Optimization by ghost image processes in neural networks
- Extensions of a tabu search adaptation to the quadratic assignment problem
- Tabu search performance on the symmetric travelling salesman problem
- Evolution based learning in a job shop scheduling environment
- Genetic algorithms and tabu search: Hybrids for optimization
- Effective job shop scheduling through active chain manipulation
- Construction of exact D-optimal designs by tabu search
- Neural networks and heuristic search
- Boolean query optimization and the 0-1 hyperbolic sum problem
- The tabu search metaheuristic: How we used it
- Fuzzy boolean programming problems with fuzzy costs: A general study
- Using tabu search to solve the common due date early/tardy machine scheduling problem
- Graph theoretic relaxations of set covering and set partitioning problems
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- A tabu search algorithm for self-healing ring network design.
- Upper and lower bounds for the single source capacitated location problem.
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
- Nature's way of optimizing
- A hybrid genetic algorithm for the open shop scheduling problem
- Heuristics for cardinality constrained portfolio optimization
- Identifying sets of key players in a social network
- Tabu list management methods for a discrete-continuous scheduling problem
- A note on global optimization in adaptive control, econometrics and macroeconomics.
- The flow shop with parallel machines: A tabu search approach
- Determining buffer location and size in production lines using tabu search
- The hot strip mill production scheduling problem: A tabu search approach
- A hybrid heuristic for the uncapacitated hub location problem
- Global optimization for artificial neural networks: A tabu search application
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Dual mean field search for large scale linear and quadratic knapsack problems
- A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs
- A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
- Detecting robust cliques in graphs subject to uncertain edge failures
- Ergonomic workplace design in the fast pick area
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
- Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap
- Online algorithms for the maximum \(k\)-colorable subgraph problem
- An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty
- A metaheuristic algorithm based on chemotherapy science: CSA
- On metaheuristics for solving the parameter estimation problem in dynamic systems: a comparative study
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
- A multiobjective optimization for train routing at the high-speed railway station based on tabu search algorithm
- A vehicle routing problem arising in unmanned aerial monitoring
- A location-inventory-routing problem in forward and reverse logistics network design
- Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem
- Exact and heuristic methods for optimizing lock-quay system in inland waterway
- Probabilistic tabu search for the cross-docking assignment problem
- A comparison of algorithms for finding an efficient theme park tour
- Improved local search approaches to solve the post enrolment course timetabling problem
- A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
- Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
- An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines
This page was built for publication: Future paths for integer programming and links to artificial intelligence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1821034)
