On the public citation graph
Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches
0 signed · 215 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/1520-6750(199203)39:2<137::aid-nav3220390202>3.0.co;2-dopenalex-snapshot
A linear relaxation heuristic for the generalized assignment problem
inferredcites →https://doi.org/10.1002/net.3230110205openalex-snapshot
A generalized assignment heuristic for vehicle routing
inferredcites →https://doi.org/10.1007/3-540-56279-6_88openalex-snapshot
Generalized assignment problems
inferredcites →https://doi.org/10.1007/978-3-030-68520-1openalex-snapshot
Metaheuristics for Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-94-015-7744-1openalex-snapshot
Simulated Annealing: Theory and Applications
inferredcites →https://doi.org/10.1007/bf01580430openalex-snapshot
A branch and bound algorithm for the generalized assignment problem
inferredcites →https://doi.org/10.1007/bf01581197openalex-snapshot
Probabilistic analysis of the generalised assignment problem
inferredcites →https://doi.org/10.1007/bf01585725openalex-snapshot
The generalized assignment problem: Valid inequalities and facets
inferredcites →https://doi.org/10.1007/bf01585726openalex-snapshot
(1,k)-configuration facets for the generalized assignment problem
inferredcites →https://doi.org/10.1007/bf01719248openalex-snapshot
Strategies with memories: local search in an application oriented environment
inferredcites →https://doi.org/10.1007/bf01720070openalex-snapshot
A comparison of techniques for solving the fleet size and mix vehicle routing problem
inferredcites →https://doi.org/10.1007/bf02022561openalex-snapshot
Dynamic tabu list management using the reverse elimination method
inferredcites →https://doi.org/10.1007/bf02023004openalex-snapshot
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
inferredcites →https://doi.org/10.1007/bf02085655openalex-snapshot
A robust heuristic for the Generalized Assignment Problem
inferredcites →https://doi.org/10.1016/0167-6377(83)90035-4openalex-snapshot
A property of assignment type mixed integer linear programming problems
inferredcites →https://doi.org/10.1016/0305-0483(89)90059-5openalex-snapshot
Simulated annealing for permutation flow-shop scheduling
inferredcites →https://doi.org/10.1016/0305-0548(79)90028-5openalex-snapshot
An effective subgradient algorithm for the generalized assignment problem
inferredcites →https://doi.org/10.1016/0305-0548(86)90048-1openalex-snapshot
Future paths for integer programming and links to artificial intelligence
inferredcites →https://doi.org/10.1016/0305-0548(93)90079-xopenalex-snapshot
An algorithm for the bottleneck generalized assignment problem
inferredcites →https://doi.org/10.1016/0377-2217(86)90328-0openalex-snapshot
A new Lagrangian relaxation approach to the generalized assignment problem
inferredcites →https://doi.org/10.1016/0377-2217(88)90426-2openalex-snapshot
A revised bound improvement sequence algorithm
inferredcites →https://doi.org/10.1016/0377-2217(89)90373-1openalex-snapshot
Annals of operations research
inferredcites →https://doi.org/10.1016/0377-2217(90)90300-zopenalex-snapshot
Improved Lagrangean decomposition: An application to the generalized assignment problem
inferredcites →https://doi.org/10.1016/0377-2217(92)90077-mopenalex-snapshot
A survey of algorithms for the generalized assignment problem
inferredcites →https://doi.org/10.1016/0377-2217(93)90011-bopenalex-snapshot
Solving large scale generalized assignment problems — An aggregation / disaggregation approach
inferredcites →https://doi.org/10.1016/0377-2217(93)e0174-vopenalex-snapshot
Tabu search for the multilevel generalized assignment problem
inferredcites →https://doi.org/10.1016/0377-2217(94)90338-7openalex-snapshot
A set partitioning heuristic for the generalized assignment problem
inferredcites →https://doi.org/10.1016/0378-4754(88)90023-7openalex-snapshot
Simulated annealing: theory and applications.
inferredcites →https://doi.org/10.1016/0951-5240(89)90009-8openalex-snapshot
Optimal assignment of orders to parallel working subplants without splitting
inferredcites →https://doi.org/10.1016/0969-6016(94)90032-9openalex-snapshot
Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search
inferredcites →https://doi.org/10.1016/0969-6016(95)00029-7openalex-snapshot
Local Search Algorithms for the Maximal Planar Layout Problem
inferredcites →https://doi.org/10.1057/jors.1990.166openalex-snapshot
OR-Library: Distributing Test Problems by Electronic Mail
inferredcites →https://doi.org/10.1080/00207548908942586openalex-snapshot
Modelling group technology cell formation as a generalized assignment problem
inferredcites →https://doi.org/10.1080/00207549208948155openalex-snapshot
A storage assignment policy in a man-on-board automated storage/retrieval system
inferredcites →https://doi.org/10.1080/01966324.1988.10737242openalex-snapshot
Simulated Annealing – An Annotated Bibliography
inferredcites →https://doi.org/10.1080/01966324.1993.10737361openalex-snapshot
Algorithms for the Vehicle Routing Problems with Time Deadlines
inferredcites →https://doi.org/10.1080/02331939108843666openalex-snapshot
A hybrid algorithm for the generalized assignment problem
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1142/s0129065790000126openalex-snapshot
DESIGN OF COMPETITION-BASED NEURAL NETWORKS FOR COMBINATORIAL OPTIMIZATION
inferredcites →https://doi.org/10.1287/ijoc.2.1.33openalex-snapshot
Tabu Search Applied to the Quadratic Assignment Problem
inferredcites →https://doi.org/10.1287/mnsc.24.3.345openalex-snapshot
Modeling Facility Location Problems as Generalized Assignment Problems
inferredcites →https://doi.org/10.1287/mnsc.25.1.107openalex-snapshot
Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
inferredcites →https://doi.org/10.1287/mnsc.26.1.86openalex-snapshot
Pivot and Complement–A Heuristic for 0-1 Programming
inferredcites →https://doi.org/10.1287/mnsc.32.9.1095openalex-snapshot
A Multiplier Adjustment Method for the Generalized Assignment Problem
inferredcites →https://doi.org/10.1287/mnsc.35.8.923openalex-snapshot
Generalized Assignment with Nonlinear Capacity Interaction
inferredcites →https://doi.org/10.1287/mnsc.37.6.695openalex-snapshot
Algorithms for the Multi-Resource Generalized Assignment Problem
inferredcites →https://doi.org/10.1287/mnsc.40.7.868openalex-snapshot
A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
inferredcites →https://doi.org/10.1287/opre.37.4.658openalex-snapshot
Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
inferredcites →https://doi.org/10.2307/2583458openalex-snapshot
Knapsack Problems: Algorithms and Computer Implementations
inferredcites →https://doi.org/10.4324/9781003463108-19openalex-snapshot
Automation and Remote Control
inferredcites →https://doi.org/10.7551/mitpress/4931.003.0017openalex-snapshot
*13 Simulated Annealing and Boltzmann Machines
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.273421openalex-extracted
Assigning Proctors to Exams with Scatter Search
inferred← citeshttps://doi.org/10.1002/(sici)1099-1425(199909/10)2:5<229::aid-jos29>3.0.co;2-lopenalex-snapshot
Optimizing cane supply decisions within a sugar mill region
inferred← citeshttps://doi.org/10.1002/jos.122openalex-snapshot
A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
inferred← citeshttps://doi.org/10.1007/0-387-23529-9_11openalex-snapshot
Modeling and Solving a Selection and Assignment Problem
inferred← citeshttps://doi.org/10.1007/0-387-23830-1_6openalex-snapshot
The Generalized Assignment Problem and Extensions
inferred← citeshttps://doi.org/10.1007/3-540-36605-9_27openalex-snapshot
A Template Approach to Producing Incremental Objective Cost Functions for Local Search Meta-heuristics
inferred← citeshttps://doi.org/10.1007/3-540-45612-0_1openalex-snapshot
Meta-heuristics: The State of the Art
inferred← citeshttps://doi.org/10.1007/3-540-48035-8_17openalex-snapshot
Feasibility Restoration for Iterative Meta-heuristics Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-71921-4_6openalex-snapshot
Reviewer Assignment for Scientific Articles using Memetic Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_200openalex-snapshot
Generalized Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-0-387-77320-9_6openalex-snapshot
Heterogeneous Wireless Networks: QoS-Aware Integration Architecture
inferred← citeshttps://doi.org/10.1007/978-1-4419-1306-7_10openalex-snapshot
Variable Intensity Local Search
inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_1openalex-snapshot
Meta-Heuristics: An Overview
inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_27openalex-snapshot
Comparison of Heuristics for the 0–1 Multidimensional Knapsack Problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_9openalex-snapshot
A Metaheuristic for the Timetabling Problem.
inferred← citeshttps://doi.org/10.1007/978-1-4615-4567-5_12openalex-snapshot
Assigning Proctors to Exams with Scatter Search
inferred← citeshttps://doi.org/10.1007/978-1-4615-4567-5_14openalex-snapshot
Explicit-Constraint Branching for Solving Mixed-Integer Programs
inferred← citeshttps://doi.org/10.1007/978-1-4615-5775-3_31openalex-snapshot
A Variable Depth Search Algorithm for the Generalized Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-4137-7_1openalex-snapshot
A Path Relinking Algorithm for the Generalized Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_200-2openalex-snapshot
Generalized Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-93247-3_51openalex-snapshot
Transportation Based Approach for Solving the Generalized Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-26504-4_30openalex-snapshot
Instance Space Analysis for the Generalized Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-20086-6_9openalex-snapshot
Separation of Generic Cutting Planes in Branch-and-Price Using a Basis
inferred← citeshttps://doi.org/10.1007/978-3-319-62392-4_10openalex-snapshot
A Hybrid CPU-GPU Scatter Search for Large-Sized Generalized Assignment Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-46865-0_6openalex-snapshot
A Local Search Heuristic for the Two-Stage Capacitated Facility Location Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-46865-0_8openalex-snapshot
Obtaining Sharp Lower and Upper Bounds for Two-Stage Capacitated Facility Location Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-56183-2_14openalex-snapshot
Combinatorial Optimisation Problems of the Assignment Type and a Partitioning Approach
inferred← citeshttps://doi.org/10.1007/bf00132501openalex-snapshot
A simple dual algorithm for the generalised assignment problem
inferred← citeshttps://doi.org/10.1007/bf01719248openalex-snapshot
Strategies with memories: local search in an application oriented environment
inferred← citeshttps://doi.org/10.1007/bf02125457openalex-snapshot
Dynamic tabu search strategies for the traveling purchaser problem
inferred← citeshttps://doi.org/10.1007/bf02125459openalex-snapshot
A tabu search algorithm for frequency assignment
inferred← citeshttps://doi.org/10.1007/s10100-021-00739-4openalex-snapshot
Competence-based assignment of tasks to workers in factories with demand-driven manufacturing
inferred← citeshttps://doi.org/10.1007/s10489-010-0270-zopenalex-snapshot
A pattern recognition based intelligent search method and two assignment problem case studies
inferred← citeshttps://doi.org/10.1007/s10589-008-9183-8openalex-snapshot
A computational study of exact knapsack separation for the generalized assignment problem
inferred← citeshttps://doi.org/10.1007/s10732-005-3208-6openalex-snapshot
An Algorithm for the Generalized Assignment Problem with Special Ordered Sets
inferred← citeshttps://doi.org/10.1007/s10878-026-01401-yopenalex-snapshot
(Pareto)-Optimization and greedy algorithm-based solutions for review and panel assignments
inferred← citeshttps://doi.org/10.1007/s13198-015-0343-9openalex-snapshot
A transportation branch and bound algorithm for solving the generalized assignment problem
inferred← citeshttps://doi.org/10.1007/s41019-023-00213-yopenalex-snapshot
A Framework to Maximize Group Fairness for Workers on Online Labor Platforms
inferred← citeshttps://doi.org/10.1016/0969-6016(94)90032-9openalex-snapshot
Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search
inferred← citeshttps://doi.org/10.1016/0969-6016(95)00029-7openalex-snapshot
Local Search Algorithms for the Maximal Planar Layout Problem
inferred← citeshttps://doi.org/10.1016/j.amc.2009.11.018openalex-snapshot
Bees algorithm for generalized assignment problem
inferred← citeshttps://doi.org/10.1016/j.amc.2011.12.025openalex-snapshot
The equilibrium generalized assignment problem and genetic algorithm
inferred← citeshttps://doi.org/10.1016/j.cor.2005.07.027openalex-snapshot
A tabu search procedure based on a random Roulette diversification for the weighted maximal planar graph problem
inferred← citeshttps://doi.org/10.1016/j.cor.2007.03.002openalex-snapshot
Improved Tabu search heuristics for the dynamic space allocation problem
inferred← citeshttps://doi.org/10.1016/j.cor.2015.10.015openalex-snapshot
Multi-neighborhood local search optimization for machine reassignment problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2004.03.005openalex-snapshot
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.04.004openalex-snapshot
Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.09.060openalex-snapshot
Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.05.007openalex-snapshot
A hybrid tabu search/branch & bound approach to solving the generalized assignment problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.06.013openalex-snapshot
A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.09.010openalex-snapshot
Two heuristic solution concepts for the vehicle selection problem in line haul transports
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.12.002openalex-snapshot
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.10.009openalex-snapshot
Improved differential evolution algorithms for solving generalized assignment problem
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.03.118openalex-snapshot
A hybrid heuristic algorithm for the sequencing generalized assignment problem in an assembly line
inferred← citeshttps://doi.org/10.1016/j.ifacol.2023.10.833openalex-snapshot
Dimension reduction for a multi-resource general assignment problem by decomposable costs for a vehicle compound
inferred← citeshttps://doi.org/10.1016/j.orl.2026.107442openalex-snapshot
An application of semi-Lagrangian relaxation to the generalised assignment problem
inferred← citeshttps://doi.org/10.1016/j.procs.2015.08.156openalex-snapshot
Guided Genetic Algorithm: A New Template Concept
inferred← citeshttps://doi.org/10.1016/j.procs.2017.05.188openalex-snapshot
A Hybrid Heuristic in GPU-CPU Based on Scatter Search for the Generalized Assignment Problem
inferred← citeshttps://doi.org/10.1016/j.trc.2012.04.014openalex-snapshot
An efficient heuristic for the Multi-vehicle One-to-one Pickup and Delivery Problem with Split Loads
inferred← citeshttps://doi.org/10.1016/s0305-0548(00)00024-1openalex-snapshot
A dynamic tabu search for large-scale generalised assignment problems
inferred← citeshttps://doi.org/10.1016/s0305-0548(96)00032-9openalex-snapshot
A genetic algorithm for the generalised assignment problem
inferred← citeshttps://doi.org/10.1016/s0360-8352(02)00180-8openalex-snapshot
Hopfield neural networks for timetabling: formulations, methods, and comparative results
inferred← citeshttps://doi.org/10.1016/s0377-2217(00)00108-9openalex-snapshot
A Tabu search heuristic for the generalized assignment problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00294-4openalex-snapshot
A tabu search approach to the constraint satisfaction problem as a general problem solver
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00300-8openalex-snapshot
A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem
inferred← citeshttps://doi.org/10.1016/s1570-7946(00)80104-2openalex-snapshot
Integer-programming based algorithms and computational performance for terminal-drop zone assignment problems
inferred← citeshttps://doi.org/10.1021/ie050478hopenalex-snapshot
Novel and Effective Integer Optimization Approach for the NSF Panel-Assignment Problem: A Multiresource and Preference-Constrained Generalized Assignment Problem
inferred← citeshttps://doi.org/10.1023/a:1011211220465openalex-snapshot
A General Meta-Heuristic Based Solver for Combinatorial Optimisation Problems
inferred← citeshttps://doi.org/10.1023/a:1018915104438openalex-snapshot
A simulated annealing code for general integer linear programs
inferred← citeshttps://doi.org/10.1023/a:1021953714975openalex-snapshot
Near-optimal design of Global Positioning System (GPS) networks using the Tabu Search technique
inferred← citeshttps://doi.org/10.1023/a:1026194423072openalex-snapshot
A New Chance-Constrained Maximum Capture Location Problem
inferred← citeshttps://doi.org/10.1023/b:anor.0000039511.61195.21openalex-snapshot
Density Based Problem Space Search for the Capacitated Clustering p-Median Problem
inferred← citeshttps://doi.org/10.1029/2010wr009919openalex-snapshot
Integrated modelling of cost‐effective siting and operation of flow‐control infrastructure for river ecosystem conservation
inferred← citeshttps://doi.org/10.1038/sj.jors.2601111openalex-snapshot
Preprocessing rules for integer programming solutions to the generalised assignment problem
inferred← citeshttps://doi.org/10.1051/matecconf/201819201015openalex-snapshot
A hybrid particle swarm optimization for the generalized assignment problem with time window
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2600431openalex-snapshot
A genetic algorithm for the generalised assignment problem
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601135openalex-snapshot
Assigning pupils to tutor groups in a comprehensive school
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601344openalex-snapshot
Tabu search variants for the mix fleet vehicle routing problem
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2602025openalex-snapshot
Scheduling of brand production and shipping within a sugar supply chain
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2602135openalex-snapshot
Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
inferred← citeshttps://doi.org/10.1080/00207543.2017.1374574openalex-snapshot
Collaborative service-component integration in cloud manufacturing
inferred← citeshttps://doi.org/10.1080/00207543.2017.1378828openalex-snapshot
Productivity improvement through a sequencing generalised assignment in an assembly line system
inferred← citeshttps://doi.org/10.1080/01969722.2022.2145659openalex-snapshot
Exact Methods for Multi-Objective Integer Nonlinear Programming
inferred← citeshttps://doi.org/10.1080/0305215x.2021.1940991openalex-snapshot
Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity
inferred← citeshttps://doi.org/10.1080/03155986.2001.11732447openalex-snapshot
An Effective Lagrangian Heuristic For The Generalized Assignment Problem
inferred← citeshttps://doi.org/10.1080/07408170600634525openalex-snapshot
Optimal implementation and benefits of rolling inventory
inferred← citeshttps://doi.org/10.1080/09720502.2008.10700590openalex-snapshot
Very large-scale variable neighborhood search for the generalized assignment problem
inferred← citeshttps://doi.org/10.1080/10170660409509411openalex-snapshot
A TABU SEARCH APPROACH TO THE GENERALIZED ASSIGNMENT PROBLEM
inferred← citeshttps://doi.org/10.1080/10556789808805722openalex-snapshot
A variable depth search algorithm with branching search for the generalized assignment problem
inferred← citeshttps://doi.org/10.1080/15732479.2019.1624787openalex-snapshot
A constraint-based, efficiency optimisation approach to network-level pavement maintenance management
inferred← citeshttps://doi.org/10.1109/access.2013.2273268openalex-snapshot
A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem
inferred← citeshttps://doi.org/10.1109/access.2019.2957303openalex-snapshot
Heuristic Approaches to Solve E-Scooter Assignment Problem
inferred← citeshttps://doi.org/10.1109/bigdata52589.2021.9671450openalex-snapshot
REAPS: Quasi-active Fault Tolerance for Big Data Publish-Subscribe Systems
inferred← citeshttps://doi.org/10.1109/cec.2004.1331130openalex-snapshot
Heuristics for ant colony optimisation using the generalised assignment problem
inferred← citeshttps://doi.org/10.1109/cec.2009.4983269openalex-snapshot
Differential Evolution Algorithms for the Generalized Assignment problem
inferred← citeshttps://doi.org/10.1109/cec.2010.5586086openalex-snapshot
Using an enhanced integer NSGA-II for solving the multiobjective Generalized Assignment Problem
inferred← citeshttps://doi.org/10.1109/coase.2007.4341668openalex-snapshot
Resource-Task Assignment Process with Rejections and Reassignments
inferred← citeshttps://doi.org/10.1109/iccvw.2011.6130494openalex-snapshot
Constrained UAV mission planning: A comparison of approaches
inferred← citeshttps://doi.org/10.1109/icitisee68184.2025.11354998openalex-snapshot
An Electric Taxi-to-Base Assignment System Using Path Relinking and Ejection Chain Optimization Computational Intelligence
inferred← citeshttps://doi.org/10.1109/icks.2004.1313429openalex-snapshot
Recent metaheuristic algorithms for the generalized assignment problem
inferred← citeshttps://doi.org/10.1109/icks.2004.30openalex-snapshot
Recent metaheuristic algorithms for the generalized assignment problem
inferred← citeshttps://doi.org/10.1109/icnsc.2019.8743322openalex-snapshot
Using Group Role Assignment to Solve Dynamic Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1109/itsc.2019.8917255openalex-snapshot
Optimal Assignment of e-scooter to Chargers
inferred← citeshttps://doi.org/10.1109/lcomm.2020.2967050openalex-snapshot
Multi-Connectivity Based Uplink/Downlink Decoupled Energy Efficient User Association in 5G Heterogenous CRAN
inferred← citeshttps://doi.org/10.1109/nof52522.2021.9609828openalex-snapshot
Building Efficient Regular Expression Matchers Through GA Optimization With ML Surrogates
inferred← citeshttps://doi.org/10.1109/pdp50117.2020.00018openalex-snapshot
M3AT: Monitoring Agents Assignment Model for Data-Intensive Applications
inferred← citeshttps://doi.org/10.1109/ssci47803.2020.9308306openalex-snapshot
Adaptive Data Replication Optimization Based on Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/tai.1998.744862openalex-snapshot
The guided genetic algorithm and its application to the generalized assignment problem
inferred← citeshttps://doi.org/10.1109/tcad.2014.2323219openalex-snapshot
Assignment of Vertical-Links to Routers in Vertically-Partially-Connected 3-D-NoCs
inferred← citeshttps://doi.org/10.1109/tgcn.2023.3262647openalex-snapshot
Joint MU-MIMO Precoding and Computation Optimization for Energy Efficient Industrial IoT With Mobile Edge Computing
inferred← citeshttps://doi.org/10.1109/ucc48980.2020.00060openalex-snapshot
A Light-Weight Approach to Software Assignment at the Edge
inferred← citeshttps://doi.org/10.1109/wsc.2015.7408383openalex-snapshot
A simulation optimization framework for discrete event logistics systems (DELS)
inferred← citeshttps://doi.org/10.1111/poms.12088openalex-snapshot
Improving Voting Systems through Service‐Operations Management
inferred← citeshttps://doi.org/10.11121/ijocta.01.2020.00825openalex-snapshot
A mathematical model for personnel task assignment problem and an application for banking sector
inferred← citeshttps://doi.org/10.1119/1.5045331openalex-snapshot
A simulated annealing approach to the student-project allocation problem
inferred← citeshttps://doi.org/10.1145/1160633.1160791openalex-snapshot
Distributed Lagrangean relaxation protocol for the generalized mutual assignment problem
inferred← citeshttps://doi.org/10.1145/1330598.1330616openalex-snapshot
Efficiency of parallel metaheuristics for solving combinatorial problems
inferred← citeshttps://doi.org/10.1145/3309549openalex-snapshot
Client-side Computational Optimization
inferred← citeshttps://doi.org/10.1145/3511808.3557148openalex-snapshot
A Practical Distributed ADMM Solver for Billion-Scale Generalized Assignment Problems
inferred← citeshttps://doi.org/10.1145/967900.968102openalex-snapshot
An improved hybrid genetic algorithm for the generalized assignment problem
inferred← citeshttps://doi.org/10.1155/2021/5803092openalex-snapshot
A Network Flow Algorithm for Solving Generalized Assignment Problem
inferred← citeshttps://doi.org/10.1186/1472-6947-13-3openalex-snapshot
Decision support for hospital bed management using adaptable individual length of stay estimations and shared resources
inferred← citeshttps://doi.org/10.1287/ijoc.1030.0036openalex-snapshot
An Ejection Chain Approach for the Generalized Assignment Problem
inferred← citeshttps://doi.org/10.1287/ijoc.2016.0703openalex-snapshot
Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations
inferred← citeshttps://doi.org/10.1287/ijoc.2024.0693openalex-snapshot
The Balanced Facility Location Problem: Complexity and Heuristics
inferred← citeshttps://doi.org/10.1287/mnsc.1040.0250openalex-snapshot
Demand Allocation in Multiple-Product, Multiple-Facility, Make-to-Stock Systems
inferred← citeshttps://doi.org/10.1287/opre.49.6.866.10021openalex-snapshot
Generating Experimental Data for the Generalized Assignment Problem
inferred← citeshttps://doi.org/10.1287/opre.51.6.922.24914openalex-snapshot
A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
inferred← citeshttps://doi.org/10.14488/1676-1901.v4i4.1852openalex-snapshot
Uma abordagem de geração de colunas para o Problema Generalizado de Atribuição
inferred← citeshttps://doi.org/10.1504/ejie.2009.027035openalex-snapshot
The bees algorithm for workload balancing in examination job assignment
inferred← citeshttps://doi.org/10.1504/ijiids.2011.040090openalex-snapshot
Three improved variants of simulated annealing for optimising dorm room assignments
inferred← citeshttps://doi.org/10.1527/tjsai.26.59openalex-snapshot
Adaptive Price Update in Distributed Lagrangian Relaxation Protocol
inferred← citeshttps://doi.org/10.1590/s0103-65132007000100005openalex-snapshot
Métodos de geração de colunas para problemas de atribuição
inferred← citeshttps://doi.org/10.17531/ein.2022.3.2openalex-snapshot
Selection of a fleet of vehicles for tasks based on the statistical characteristics of their operational parameters
inferred← citeshttps://doi.org/10.26034/lu.akwi.2019.3246openalex-snapshot
Solving non-quadratic Matrices in Assignment Problems with an improved Version of Vogel's Approximation Method
inferred← citeshttps://doi.org/10.2991/isci-15.2015.190openalex-snapshot
An Improved Firefly Algorithm and its application in Time-table Problems
inferred← citeshttps://doi.org/10.3138/infor.45.3.002openalex-snapshot
A Survey of the Generalized Assignment Problem and Its Applications
inferred← citeshttps://doi.org/10.3141/1923-01openalex-snapshot
Online Dispatching and Routing Model for Emergency Vehicles with Area Coverage Constraints
inferred← citeshttps://doi.org/10.3141/2426-02openalex-snapshot
Optimal Dredge Fleet Scheduling within Environmental Work Windows
inferred← citeshttps://doi.org/10.3166/jds.14.83-107openalex-snapshot
Hybrid Genetic Algorithm for the Generalised Assignment Problem
inferred← citeshttps://doi.org/10.3390/admsci9010003openalex-snapshot
Methodology to Solve the Combination of the Generalized Assignment Problem and the Vehicle Routing Problem: A Case Study in Drug and Medical Instrument Sales and Service
inferred← citeshttps://doi.org/10.3390/ai6080177openalex-snapshot
AI-Driven Panel Assignment Optimization via Document Similarity and Natural Language Processing
inferred← citeshttps://doi.org/10.3390/electronics8070723openalex-snapshot
M3C: Multimodel-and-Multicue-Based Tracking by Detection of Surrounding Vessels in Maritime Environment for USV
inferred← citeshttps://doi.org/10.3390/joitmc5010005openalex-snapshot
Solving a Special Case of the Generalized Assignment Problem Using the Modified Differential Evolution Algorithms: A Case Study in Sugarcane Harvesting
inferred← citeshttps://doi.org/10.3390/land14061245openalex-snapshot
Optimizing PV Panel Segmentation in Complex Environments Using Pre-Training and Simulated Annealing Algorithm: The JSWPVI
inferred← citeshttps://doi.org/10.3906/elk-1504-250openalex-snapshot
A modified genetic algorithm for a special case of the generalized assignment problem
inferred← citeshttps://doi.org/10.46632/1/1/3openalex-snapshot
An Investigation on Tabu Search Algorithms Optimization
inferred← citeshttps://doi.org/10.46632/eae/1/1/3openalex-snapshot
An Investigation on Tabu Search Algorithms Optimization
inferred← citeshttps://doi.org/10.51359/2965-4661.2024.260042openalex-snapshot
A mixed-integer linear programming model for scheduling volunteers in technical support teams in Non-Governmental Organizations
inferred← citeshttps://doi.org/10.5281/zenodo.1070254openalex-snapshot
A New Heuristic Approach For The Large-Scale Generalized Assignment Problem
inferred← citeshttps://doi.org/10.5281/zenodo.1331258openalex-snapshot
Multi-Case Multi-Objective Simulated Annealing (Mc-Mosa): New Approach To Adapt Simulated Annealing To Multi-Objective Optimization
inferred← citeshttps://doi.org/10.5755/j01.itc.48.3.21893openalex-snapshot
A New Genetic Algorithm with Agent-Based Crossover for Generalized Assignment Problem
inferred← citeshttps://doi.org/10.5772/5101openalex-snapshot
Artificial Bee Colony Algorithm and Its Application to Generalized Assignment Problem
inferred← citeshttps://doi.org/10.5772/7824openalex-snapshot
Computational Experience in Methods for Finding Tight Lower Bounds for the Sparse Travelling Salesman Problem
inferred← citeshttps://doi.org/10.6028/nist.ir.8326openalex-snapshot
A model-driven approach to interoperability between simulation and optimization for production and logistics systems
inferred← citeshttps://doi.org/10.70675/bc381389zcfb6z4191z8684z8e92abbebaf7openalex-snapshot
The dynamic parking allocation problem : theoretical and practical solution methods
inferred← citeshttps://doi.org/10.7148/2019-0261openalex-snapshot
Solving Non-Quadratic Matrices In Assignment Problems With An Improved Version Of Vogel's Approximation Method
inferred← citeshttps://doi.org/10.7148/2021-0016openalex-snapshot
Evaluation Of Algorithm Performance For Simulated Square And Non-Square Logistic Assignment Problems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.