Heuristic methods and applications: A categorized survey
From MaRDI portal
Publication:1823879
DOI10.1016/0377-2217(89)90412-8zbMath0681.90090OpenAlexW2082163883MaRDI QIDQ1823879
James R. Evans, Stelios H. Zanakis, Alkis A. Vazacopoulos
Publication date: 1989
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(89)90412-8
Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mathematical programming (90C99)
Related Items
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, Determining optimal police patrol areas with maximal covering and backup covering location models, Routing problems: A bibliography, Metaheuristics: A bibliography, Designing and reporting on computational experiments with heuristic methods, Designing communication networks for distributed control agents., Three approximation algorithms for solving the generalized segregated storage problem., Combinatorial aspects of construction of competition Dutch professional football leagues, A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation, Finding discrete global minima with a filled function for integer programming, Comparison of the performance of modern heuristics for combinatorial optimization on real data, An approximate algorithm for nonlinear integer programming, An approximate algorithm for nonlinear integer programming, A new filled function method for nonlinear integer programming problem, Project selection with discounted returns and multiple constraints
Cites Work
- Experimental results on Hillier's linear search
- Optimal and Heuristic Decisions in Single-and Multi-Item Inventory Systems
- One machine sequencing to minimize mean flow time with minimum number tardy
- An Algorithm for the Solution of 0-1 Loading Problems
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
- On scheduling with earliest starts and due dates on a group of identical machines
- Project scheduling: The effects of problem structure on heuristic performance
- Algorithms for Scheduling Independent Tasks
- Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation
- Random Juror Selection from Multiple Lists
- Solving a (0, 1) hyperbolic program by branch and bound
- Integer programming approaches to the travelling salesman problem
- A Consumer Preference Approach to the Planning of Rural Primary Health-Care Facilities
- Optimal Location of Plants
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Myopic Approximations for the Perishable Inventory Problem
- P-Complete Approximation Problems
- Decomposition of a Multi-Period Media Scheduling Model in Terms of Single Period Equivalents
- Technical Note—Optimality of a Heuristic Solution for a Class of Knapsack Problems
- Hospital Layout as a Quadratic Assignment Problem
- Lot Sizing and Sequencing for N Products on One Facility
- Implementing vehicle routing algorithms
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Minimising Waiting Time Variance in the Single Machine Problem
- Approximate Algorithms for the 0/1 Knapsack Problem
- Experiments in mixed-integer linear programming using pseudo-costs
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Production Runs for Multiple Products: The Two-Product Heuristic
- An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
- Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
- The m-Center Problem: Minimax Facility Location
- Higher-Order Approximations for the Perishable-Inventory Problem
- Probabilistic ideas in heuristic algorithms for solving some scheduling problems
- An Evaluation of Flow Shop Sequencing Heuristics
- Performance Guarantees for Scheduling Algorithms
- A Quantitative Model to Plan Regional Health Facility Systems
- A manpower planning/capital budgeting model (MAPCAB)
- Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem
- A Diffusion Approximation to the Multi-Server Queue
- An analysis of approximations for maximizing submodular set functions—I
- Geometric Approaches to Solving the Traveling Salesman Problem
- Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
- Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
- Multiple Objective Districting: A General Heuristic Approach Using Multiple Criteria
- Heuristic for the Asymmetric Travelling Salesman Problem
- On the Complexity of Local Search for the Traveling Salesman Problem
- On a Real-Time Scheduling Problem
- Scheduling Boats to Sample Oil Wells in Lake Maracaibo
- A Heuristic Method For Obtaining An Integer Solution To A Facility Design Optimization Problem
- Production Switching Heuristics for the Aggregate Planning Problem
- A Patrol Car Allocation Model: Capabilities and Algorithms
- Combinatorial Problems: Reductibility and Approximation
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Tight bounds for christofides' traveling salesman heuristic
- Rules of Thumb and the Impact of Debt in Capital Budgeting Models
- Interval estimation of a global optimum for large combinatorial problems
- Heuristic for the Hamiltonian Path Problem in Euclidian Two Space
- A statistical approach to the tsp
- Exact and approximate algorithms for optimal network design
- A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion
- An exact branch-and-bound procedure for the quadratic-assignment problem
- Approximation Algorithms for Some Postman Problems
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Approximative Algorithms for Discrete Optimization Problems
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
- Heuristic-Programming Solution of a Flowshop-Scheduling Problem
- Optimization with an approximate Lagrangian
- Scheduling with parallel processors and linear delay costs
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- Some Methods of Producing Approximate Solutions to Travelling Salesman Problems with Hundreds or Thousands of Cities
- An Efficient Algorithm for Multi-Item Scheduling
- Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
- Algorithms for Large-scale Travelling Salesman Problems
- Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Quadratic assignment problems
- An introduction to timetabling
- An algorithm for the two-dimensional assortment problem
- Ramsey numbers and an approximation algorithm for the vertex cover problem
- Worst-case analysis of two travelling salesman heuristics
- Guaranteed performance heuristics for the bottleneck traveling salesman problem
- Transmission facility planning in telecommunications networks: A heuristic approach
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- Large-scale mixed integer programming: Benders-type heuristics
- A performance guarantee for the greedy set-partitioning algorithm
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
- A partitioning algorithm for minimum weighted Euclidean matching
- Multi-stage production with variable lot sizes and transportation of partial lots
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- A storage-size selection problem
- A heuristic lagrangean algorithm for the capacitated plant location problem
- Probabilistic behaviour of optimal bin-packing solutions
- Fixed charge problems with identical fixed charges
- A decision-theoretic framework for comparing heuristics
- Heuristics for the capacitated plant location model
- A useful transform of standard input data for a classical NP-complete problem
- A tree search algorithm for the multi-commodity location problem
- Probabilistic bounds for dual bin-packing
- A comparison of average and discounted cost models for the dynamic lot size inventory problem
- Worst-case analysis of a scheduling algorithm
- The cutting stock problem for large sections in the iron and steel industries
- Analysis of heuristics for finding a maximum weight planar subgraph
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- ADD-heuristics' starting procedures for capacitated plant location models
- A heuristic approach to the bus driver scheduling problem
- Approximation schemes for the subset-sum problem: Survey and experimental analysis
- Decomposing a set of points into chains, with applications to permutation and circle graphs
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms
- Optimal and heuristic algorithms for multiproduct uncapacitated facility location
- On different approximation criteria for subset product problems
- Location-allocation on congested networks
- On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem
- Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem
- Average and worst-case analysis of heuristics for the maximum tardiness problem
- The two-machine sequence dependent flowshop scheduling problem
- An integer programming model for the allocation of databases in a distributed computer system
- A study of the bottleneck single source transportation problem
- The fleet size and mix vehicle routing problem
- Implementation techniques for the vehicle routing problem
- Determining an upper bound for a class of rectangular packing problems
- A methodology for multicriteria network partitioning
- Edge exchanges in the degree-constrained minimum spanning tree problem
- A heuristic for multiple choice programming
- Conditional covering: greedy heuristics and computational results
- A graph coloring algorithm for large scale scheduling problems
- The assignment-to-days problems in a school time-table, a heuristic approach
- Solving the optimal network problem
- Optimal and canonical solutions of the change making problem
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
- Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane
- Heuristics and their design: A survey
- Probabilistic analysis of solving the assignment problem for the traveling salesman problem
- Worst case performance for lot sizing heuristics
- Identification of non-optimal arcs for the traveling salesman problem
- Assembly line balancing as generalized bin packing
- Heuristic procedures for the m-partial cover problem on a plane
- Approximation algorithms for combinatorial problems
- Approximate algorithms for some generalized knapsack problems
- A family of heuristic solution methods for a class of nonlinear programming problems
- The stochastic transportation-location problem
- A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
- Multiple objective dynamic programming with forward filtering
- Task allocation in fault-tolerant distributed systems
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- Fast algorithms for bin packing
- Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems
- Graph Coloring Using Eigenvalue Decomposition
- Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach
- Random Procedures for Nonredundant Constraint Identification in Stochastic Linear Programs
- On a dual version of the one-dimensional bin packing problem
- Stochastic Methods for Global Optimization
- Confidence Limits for Global Optima Based on Heuristic Solutions to Difficult Optimization Problems: A Simulation Study
- Some Add-Drop and Drop-Add Interchange Heuristics for Non-Linear Warehouse Location
- Performance of Heuristics for a Computer Resource Allocation Problem
- An Heuristic Method for Solving Time-Sensitive Routeing Problems
- An efficient heuristic for large set covering problems
- Bounds for naive multiple machine scheduling with release times and deadlines
- Complexity of the Project Sequencing Problem
- Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
- FALSA-facilities allocation by statistical analysis Part I. Further investigations on the cost distribution associated with the problem of facilities design
- FALSA-Facilities allocation by statistical analysis Part II. An heuristic algorithm to the problem of facilities design
- A survey and evaluation of static flowshop scheduling heuristics
- The period routing problem
- Heuristic analysis of closed queueing networks
- Heuristic matching for graphs satisfying the triangle inequality
- Lot sizing algorithms with applications to engineering and economics
- An efficient heuristic for the multi-item newsboy problem with a single constraint
- The p-Centre Problem-Heuristic and Optimal Algorithms
- Scheduling Independent Tasks on Uniform Processors
- Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
- Probabilistic Analysis of Bin Packing Heuristics
- Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems
- Dynamic Bin Packing
- Bounds for Multifit Scheduling on Uniform Processors
- An improved disaggregation method for transportation problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the refinement of bounds of heuristic algorithms for the traveling salesman problem
- An Improved Heuristic for the Quadratic Assignment Problem
- The effectiveness of heuristic algorithms for multi-item inventory systems with joint replenishment costs
- Probabilistic Analysis of Geometric Location Problems
- Performance testing of rectangular parts-nesting heuristics
- A Cost Adjustment Heuristic for Dynamic Lot-Sizing with Uncertain Demand Timing
- Heuristic modeling of supply availabilities in large networks
- Extracting embedded generalized networks from linear programming problems
- Heuristics for finding a maximum number of disjoint bounded paths
- A heuristic approach to the single facility maximin location problem
- Heuristics for resource-constrained scheduling†
- Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems
- Bounds for Assembly Line Balancing Heuristics
- Probabilistic analysis of a network design problem heuristic
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
- An efficient heuristic method for the simple assembly line balancing problem
- A class of network design problems with multiple demand: Model formulation and an algorithmic approach
- Advanced start for the multicommodity network flow problem
- A heuristic procedure for calculating telecommunication transmission networks in consideration of network reliability
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- A Heuristic Algorithm for Assigning Crews among Bases in an Airlift Operation
- Heuristics for Multilevel Lot-Sizing with a Bottleneck
- The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
- Two level heuristic for the resource constrained scheduling problem
- A Sequencing Problem with Release Dates and Clustered Jobs
- A heuristic with tie breaking for certain 0–1 integer programming models
- SHAPE: A construction algorithm for area placement evaluation
- Focused Scheduling in Proportionate Flowshops
- Note—Performance Bounds for Lot Sizing Heuristics
- On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
- A heuristic circulation-network approach to solve the multi-traveling salesman problem
- Evaluating the Effectiveness of a New Method for Computing Approximately Optimal (s, S) Inventory Policies
- Fast Approximation Algorithms for Knapsack Problems
- Bounds on the Effect of Aggregating Variables in Linear Programs
- Probabilistic Analysis of the Planar k-Median Problem
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- A note on heuristics for the traveling salesman problem
- A Heuristic Scheduling Algorithm
- Heuristic improvement methods: How should starting solutions be chosen?
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- Interior Path Methods for Heuristic Integer Programming Procedures
- Production Runs for Multiple Products: The Full-Capacity Heuristic
- A Greedy Heuristic for the Set-Covering Problem
- Worst case analysis of greedy type algorithms for independence systems
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Approximate Traveling Salesman Algorithms
- Local Search for the Asymmetric Traveling Salesman Problem
- Steady State Policies for Deterministic Dynamic Programs
- Worst-Case Analysis of Heuristic Algorithms
- An Algorithm for Large Zero-One Knapsack Problems
- Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit
- Improving Solutions of a Class of Allocation Problems by Cyclic Shifts of Resources
- Heuristic Techniques for Simultaneous Scheduling of Production and Distribution in Multi-Echelon Structures: Theory and Empirical Comparisons
- An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
- Service Level Relationships in a Multi-Echelon Inventory System
- A Two Stage Solution Procedure for the Lock Box Location Problem
- A restricted Lagrangean approach to the traveling salesman problem
- The Multiregion Dynamic Capacity Expansion Problem, Part II
- Equalization of Runout Times
- Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors
- A Greedy Heuristic for Single Machine Sequencing with Precedence Constraints
- A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
- On a Greedy Heuristic for Complete Matching
- Heuristics for the fixed cost median problem
- An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- Note—Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems
- Multi-Project Scheduling: Categorization of Heuristic Rules Performance
- Simple Heuristics for the School Assignment Problem
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Improved Heuristics for Multi-Stage Requirements Planning Systems
- Worst case analysis of a class of set covering heuristics
- An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
- Note—Single and Double Vertex Substitution in Heuristic Procedures for the p-Median Problem
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
- Heuristics for Multistage Production Planning Problems
- Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
- The Travelling Salesman Problem and Minimum Matching in the Unit Square
- Heuristics for planar minimum‐weight perfect metchings
- Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching
- Multiperiod Resource Allocation with Variable Technology
- An efficient heuristic procedure for the capacitated warehouse location problem
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Technical Note—Multidimensional Sequencing Rule
- Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II—Computation and Structure
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- When the Greedy Solution Solves a Class of Knapsack Problems
- Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage
- Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
- Note—Optimal Heuristic Decisions for the s, S Inventory Policy
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- Dispatching from Depot Repair in a Recoverable Item Inventory System: On the Optimality of a Heuristic Rule
- Computing capacitated minimal spanning trees efficiently
