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.

• A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm (Q652663) (← links)
• Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
• A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations (Q657059) (← links)
• Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system (Q666168) (← links)
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP (Q689251) (← links)
• A fixed point operator for the generalised maximum satisfiability problem (Q689970) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
• A two-phase hybrid metaheuristic for the vehicle routing problem with time windows (Q707148) (← links)
• A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem (Q709119) (← links)
• Construction and improvement algorithms for dispersion problems (Q726217) (← links)
• TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph (Q750320) (← links)
• Algorithms for the maximum satisfiability problem (Q753502) (← links)
• Tabu search for large scale timetabling problems (Q806794) (← links)
• A convoy scheduling problem (Q811336) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• Metaheuristics in combinatorial optimization (Q817206) (← links)
• ARMS: an automated resource management system for British telecommunications plc (Q819091) (← links)
• Modeling reverse logistic tasks within closed-loop supply chains: an example from the automotive industry (Q819103) (← links)
• A novel two-stage framework for reducing ergonomic risks of a mixed-model parallel U-shaped assembly-line (Q823484) (← links)
• New simple and efficient heuristics for the uncapacitated single allocation hub location problem (Q833533) (← links)
• The discrete time/cost trade-off problem: Extensions and heuristic procedures (Q835571) (← links)
• Graph colouring approaches for a satellite range scheduling problem (Q835607) (← links)
• On-line decision support for take-off runway scheduling with uncertain taxi times at London heathrow airport (Q835619) (← links)
• A comparison of five heuristics for the multiple depot vehicle scheduling problem (Q835636) (← links)
• Classification of applied methods of combinatorial optimization (Q844352) (← links)
• The service allocation problem at the Gioia Tauro maritime terminal (Q852990) (← links)
• Developing effective meta-heuristics for a probabilistic location model via experimental design (Q856202) (← links)
• Topological dynamics characterization for LEO satellite networks (Q856707) (← links)
• A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
• A tabu search approach for solving a difficult forest harvesting machine location problem (Q863994) (← links)
• The gravity \(p\)-median model (Q864043) (← links)
• A hybrid meta-heuristic for the batching problem in just-in-time flow shops (Q864936) (← links)
• A bicriteria flowshop scheduling problem with setup times (Q865584) (← links)
• General solutions to the single vehicle routing problem with pickups and deliveries (Q869591) (← links)
• Designing delivery districts for the vehicle routing problem with stochastic demands (Q872114) (← links)
• Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem (Q881527) (← links)
• A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284) (← links)
• Compact normal forms in propositional logic and integer programming formulations (Q910335) (← links)
• A network-related nuclear power plant model with an intelligent branch- and-bound solution approach (Q917441) (← links)
• Optimal configuration selection for reconfigurable manufacturing systems (Q930140) (← links)
• Modelling the dynamics of stochastic local search on \(k\)-SAT (Q930153) (← links)
• Tabu search for attribute reduction in rough set theory (Q931456) (← links)
• Soft car sequencing with colors: lower bounds and optimality proofs (Q932214) (← links)
• A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
• Hybrid particle swarm optimization and tabu search approach for selecting genes for tumor classification using gene expression data (Q936035) (← links)
• A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
• Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem (Q953320) (← links)
• A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria (Q954034) (← links)
• Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem (Q954251) (← links)