Pages that link to "Item:Q1821034"
From MaRDI portal
The following pages link to Future paths for integer programming and links to artificial intelligence (Q1821034):
Displaying 50 items.
- Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation (Q954934) (← links)
- A mixed integer linear program and tabu search approach for the complementary edge covering problem (Q964367) (← links)
- The undirected capacitated arc routing problem with profits (Q975994) (← links)
- Metaheuristics for assortment problems with multiple quality levels (Q976046) (← links)
- Vehicle routing with stochastic time-dependent travel times (Q976985) (← links)
- A multi-level genetic algorithm for a multi-stage space allocation problem (Q984123) (← links)
- Efficient heuristic algorithms for path-based hardware/software partitioning (Q988463) (← links)
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649) (← links)
- A population-based variable neighborhood search for the single machine total weighted tardiness problem (Q1001005) (← links)
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) (← links)
- Allocation search methods for a generalized class of location-allocation problems (Q1011223) (← links)
- A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254) (← links)
- Optimal location with equitable loads (Q1026600) (← links)
- The multiple server center location problem (Q1026602) (← links)
- Competitive facility location on decentralized supply chains (Q1027530) (← links)
- A hybrid evolution strategy for the open vehicle routing problem (Q1038279) (← links)
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries (Q1039783) (← links)
- A tabu search algorithm for scheduling pharmaceutical packaging operations (Q1039804) (← links)
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods (Q1040972) (← links)
- Solving a manpower scheduling problem for airline catering using metaheuristics (Q1041027) (← links)
- Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
- Heuristics for the dynamic facility layout problem with unequal-area departments (Q1044151) (← links)
- New approaches for heuristic search: A bilateral linkage with artificial intelligence (Q1111942) (← links)
- A new heuristic method for the flow shop sequencing problem (Q1119464) (← links)
- Tabu search techniques. A tutorial and an application to neural networks (Q1120479) (← links)
- A comparison of stochastic scheduling rules for maximizing project net present value (Q1127130) (← links)
- Exchanges procedures for timetabling problems (Q1186312) (← links)
- Finding a feasible course schedule using Tabu search (Q1186313) (← links)
- Location and sizing of offshore platforms for oil exploration (Q1194731) (← links)
- Restricted neighborhood in the tabu search for the flowshop problem (Q1203798) (← links)
- STABULUS: A technique for finding stable sets in large graphs with tabu search (Q1262136) (← links)
- Optimizing tabu list size for the traveling salesman problem (Q1265842) (← links)
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem (Q1266629) (← links)
- General local search methods (Q1268283) (← links)
- An efficient tabu search procedure for the \(p\)-median problem (Q1278496) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization (Q1280136) (← links)
- Fuzzy sets and operations research: Perspectives (Q1282905) (← links)
- A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem (Q1290704) (← links)
- Heuristic concentration and tabu search: A head to head comparison (Q1291635) (← links)
- Nonlinear integer programming by Darwin and Boltzmann mixed strategy (Q1291726) (← links)
- An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups (Q1296704) (← links)
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms) (Q1327232) (← links)
- Large-scale layout of facilities using a heuristic hybrid algorithm (Q1337243) (← links)
- A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits (Q1339115) (← links)
- Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems (Q1339121) (← links)
- Using the tabu search method for the distribution of supplies in a hospital (Q1339143) (← links)
- Unrelated parallel machine scheduling using local search (Q1341398) (← links)
- Optimization by ghost image processes in neural networks (Q1342097) (← links)
