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.
- Extensions of a tabu search adaptation to the quadratic assignment problem (Q1342101) (← links)
- Tabu search performance on the symmetric travelling salesman problem (Q1342103) (← links)
- Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
- Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
- Effective job shop scheduling through active chain manipulation (Q1342330) (← links)
- Construction of exact D-optimal designs by tabu search (Q1351866) (← links)
- Neural networks and heuristic search (Q1356210) (← links)
- Boolean query optimization and the 0-1 hyperbolic sum problem (Q1356211) (← links)
- The tabu search metaheuristic: How we used it (Q1356212) (← links)
- Fuzzy boolean programming problems with fuzzy costs: A general study (Q1367461) (← links)
- Using tabu search to solve the common due date early/tardy machine scheduling problem (Q1373879) (← links)
- Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. (Q1406947) (← links)
- Guidelines for the use of meta-heuristics in combinatorial optimization. (Q1410607) (← links)
- A tabu search algorithm for self-healing ring network design. (Q1410612) (← links)
- Upper and lower bounds for the single source capacitated location problem. (Q1410616) (← links)
- Minimizing the makespan for the flow shop scheduling problem with availability constraints. (Q1420378) (← links)
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
- Nature's way of optimizing (Q1575193) (← links)
- A hybrid genetic algorithm for the open shop scheduling problem (Q1576331) (← links)
- Heuristics for cardinality constrained portfolio optimization (Q1582684) (← links)
- Tabu list management methods for a discrete-continuous scheduling problem (Q1600837) (← links)
- A note on global optimization in adaptive control, econometrics and macroeconomics. (Q1605221) (← links)
- The flow shop with parallel machines: A tabu search approach (Q1609888) (← links)
- Determining buffer location and size in production lines using tabu search (Q1609894) (← links)
- The hot strip mill production scheduling problem: A tabu search approach (Q1609896) (← links)
- A hybrid heuristic for the uncapacitated hub location problem (Q1609911) (← links)
- Global optimization for artificial neural networks: A tabu search application (Q1609919) (← links)
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923) (← links)
- Dual mean field search for large scale linear and quadratic knapsack problems (Q1620646) (← links)
- A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs (Q1631504) (← links)
- 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 (Q1634053) (← links)
- Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
- Ergonomic workplace design in the fast pick area (Q1642056) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem (Q1651637) (← links)
- 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 (Q1652033) (← links)
- Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap (Q1652132) (← links)
- Online algorithms for the maximum \(k\)-colorable subgraph problem (Q1652561) (← links)
- An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty (Q1652700) (← links)
- A metaheuristic algorithm based on chemotherapy science: CSA (Q1659258) (← links)
- On metaheuristics for solving the parameter estimation problem in dynamic systems: a comparative study (Q1659343) (← links)
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem (Q1681522) (← links)
- A multiobjective optimization for train routing at the high-speed railway station based on tabu search algorithm (Q1721527) (← links)
- A vehicle routing problem arising in unmanned aerial monitoring (Q1722956) (← links)
- A location-inventory-routing problem in forward and reverse logistics network design (Q1727487) (← links)
- Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem (Q1730435) (← links)
- Exact and heuristic methods for optimizing lock-quay system in inland waterway (Q1737520) (← links)
- Probabilistic tabu search for the cross-docking assignment problem (Q1740539) (← links)
- A comparison of algorithms for finding an efficient theme park tour (Q1741683) (← links)