Pages that link to "Item:Q1821034"

The following pages link to Future paths for integer programming and links to artificial intelligence (Q1821034):

Displaying 50 items.

• Improved local search approaches to solve the post enrolment course timetabling problem (Q1753553) (← links)
• A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints (Q1754044) (← links)
• A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
• Managing the tabu list length using a fuzzy inference system: an application to examination timetabling (Q1761914) (← links)
• Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem (Q1762025) (← links)
• Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs (Q1762084) (← links)
• An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines (Q1762138) (← links)
• New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem (Q1764754) (← links)
• A TABU search heuristic for the team orienteering problem (Q1764755) (← links)
• Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
• Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models (Q1767683) (← links)
• Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
• A tabu search algorithm for the routing and capacity assignment problem in computer networks (Q1781553) (← links)
• Applying tabu search to backup path planning for multicast networks (Q1781560) (← links)
• Single-solution simulated Kalman filter algorithm for global optimisation problems (Q1789165) (← links)
• A biobjective and trilevel programming model for hub location problem in design of a resilient power projection network (Q1793287) (← links)
• Research on medicine distribution route optimization for community health service institutions (Q1793412) (← links)
• A distributed genetic algorithm for deterministic and stochastic labor scheduling problems (Q1806613) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
• Guided local search and its application to the traveling salesman problem (Q1808420) (← links)
• Application of heuristic methods for conformance test selection (Q1847243) (← links)
• Optimization of pitch sequencing for pneumatic tire by tabu search method (Q1859349) (← links)
• Fuzzy J-means: a new heuristic for fuzzy clustering (Q1860175) (← links)
• A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan (Q1860373) (← links)
• Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
• A neuro-tabu search heuristic for the flow shop scheduling problem (Q1885991) (← links)
• Solving transportation problems with nonlinear side constraints with tabu search (Q1892666) (← links)
• Improving the performance of enumerative search methods. I: Exploiting structure and intelligence (Q1892667) (← links)
• Improving the performance of enumerative search methods. II: Computational experiments (Q1905078) (← links)
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
• Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue (Q1908990) (← links)
• A local search approach for two-dimensional irregular cutting (Q1908994) (← links)
• Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements (Q1908996) (← links)
• Deadline scheduling of multiprocessor tasks (Q1917262) (← links)
• An improved tabu search approach for solving the job shop scheduling problem with tooling constraints (Q1917279) (← links)
• Simulated annealing metaheuristics for the vehicle routing problem with time windows (Q1919832) (← links)
• Focused simulated annealing search: An application to job shop scheduling (Q1919835) (← links)
• Diversification strategies in tabu search algorithms for the maximum clique problem (Q1919840) (← links)
• A tabu thresholding algorithm for arc crossing minimization in bipartite graphs (Q1919842) (← links)
• A tabu search algorithm for frequency assignment (Q1919845) (← links)
• Heuristic reliability optimization by tabu search (Q1919847) (← links)
• Genetic and hybrid algorithms for graph coloring (Q1919854) (← links)
• A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control (Q1922638) (← links)
• Tabu search heuristics for the order batching problem in manual order picking systems (Q1926958) (← links)
• Exact and heuristic procedures for solving the fuzzy portfolio selection problem (Q1927253) (← links)
• Tabu search for the BWC problem (Q1928269) (← links)
• Heuristic optimisation in financial modelling (Q1931632) (← links)
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem (Q1969832) (← links)