On the public citation graph

A hybrid grouping genetic algorithm for bin packing

https://doi.org/10.1007/bf00226291
0 signed · 565 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-60154-6_54openalex-snapshot
Genetic algorithms for cutting stock problems: With and without contiguity
inferredcites →https://doi.org/10.1007/bf02125404openalex-snapshot
Hybrid genetic algorithms for bin-packing and related problems
inferredcites →https://doi.org/10.1016/0166-218x(90)90094-sopenalex-snapshot
Lower bounds and reduction procedures for the bin packing problem
inferredcites →https://doi.org/10.1016/0377-2217(91)90159-sopenalex-snapshot
Knapsack problems, algorithms and computer implementations
inferredcites →https://doi.org/10.1016/0378-7796(94)00857-4openalex-snapshot
Optimal clustering of power networks using genetic algorithms
inferredcites →https://doi.org/10.1109/robot.1992.220088openalex-snapshot
A genetic algorithm for bin packing and line balancing
inferredcites →https://doi.org/10.1162/evco.1994.2.2.123openalex-snapshot
A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems
inferredcites →https://doi.org/10.4324/9781315799674openalex-snapshot
Proceedings of the First International Conference on Genetic Algorithms and their Applications
inferredcites →https://doi.org/10.5860/choice.27-0936openalex-snapshot
Genetic algorithms in search, optimization, and machine learning
inferredcites →https://doi.org/10.7551/mitpress/1090.001.0001openalex-snapshot
Adaptation in Natural and Artificial Systems

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.4830425openalex-extracted
Local-Search and Price-and-Branch Heuristics for Vector Bin Packing
inferred← citeshttps://doi.org/10.1002/9780470050118.ecse169openalex-snapshot
Genetic Algorithms
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0001openalex-snapshot
A Concise Overview of Applications of Ant Colony Optimization
inferred← citeshttps://doi.org/10.1002/9780470611050.ch3openalex-snapshot
Metaheuristics and Scheduling
inferred← citeshttps://doi.org/10.1002/dac.1342openalex-snapshot
An ant colony optimisation algorithm for aggregated multicast based on minimum grouping model
inferred← citeshttps://doi.org/10.1002/ett.4763openalex-snapshot
Resource allocation and user assignment schemes in cellular supported industrial IoT networks
inferred← citeshttps://doi.org/10.1002/nme.6161openalex-snapshot
Packaging optimization using the dynamic vector fields method
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_125openalex-snapshot
EVOLUTIONARY ALGORITHMS IN COMBINATORIAL OPTIMIZATION
inferred← citeshttps://doi.org/10.1007/0-387-22827-6_1openalex-snapshot
Heuristic Search for Network Design
inferred← citeshttps://doi.org/10.1007/11844297_104openalex-snapshot
Exploration and Exploitation Bias of Crossover and Path Relinking for Permutation Problems
inferred← citeshttps://doi.org/10.1007/11844297_87openalex-snapshot
Evolving Bin Packing Heuristics with Genetic Programming
inferred← citeshttps://doi.org/10.1007/11925231_37openalex-snapshot
A Refined Evaluation Function for the MinLA Problem
inferred← citeshttps://doi.org/10.1007/3-540-32363-5_7openalex-snapshot
Hybrid Evolutionary Approaches to Terminal Assignment in Communications Networks
inferred← citeshttps://doi.org/10.1007/3-540-45110-2_5openalex-snapshot
Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics
inferred← citeshttps://doi.org/10.1007/3-540-45718-6_23openalex-snapshot
The Match Fit Algorithm - A Testbed for Computational Motivation of Attention
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_167openalex-snapshot
Evolutionary Algorithms in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4612-1542-4_4openalex-snapshot
Applying Genetic Algorithms to Real-World Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3437-8_17openalex-snapshot
The Grouping Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4757-3762-2_6openalex-snapshot
An Evolutionary Approach to the Multi-Level Capacitated Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-16657-1_1openalex-snapshot
A Study of Multi-space Search Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_27openalex-snapshot
A Generic Exact Solver for Vehicle Routing and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-43680-3_12openalex-snapshot
A Group Genetic Algorithm for Resource Allocation in Container-Based Clouds
inferred← citeshttps://doi.org/10.1007/978-3-030-49076-8_30openalex-snapshot
A Preliminary Study on Score-Based Hyper-heuristics for Solving the Bin Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_167-1openalex-snapshot
Evolutionary Algorithms in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_34openalex-snapshot
New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-58628-7_7openalex-snapshot
Security-Aware Database Migration Planning
inferred← citeshttps://doi.org/10.1007/978-3-030-61534-5_25openalex-snapshot
A Study of Bi-space Search for Solving the One-Dimensional Bin Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-97546-3_42openalex-snapshot
Hybrid Grouping Genetic Algorithm for Large-Scale Two-Level Resource Allocation of Containers in the Cloud
inferred← citeshttps://doi.org/10.1007/978-3-031-08266-5_17openalex-snapshot
Optimization Models and Methods for Bin Packing Problems: A Case Study on Solving 1D-BPP
inferred← citeshttps://doi.org/10.1007/978-3-031-16224-4_3openalex-snapshot
Genetic Algorithm for the Variable Sized Vector Bin-Packing Problem with the Limited Number of Bins
inferred← citeshttps://doi.org/10.1007/978-3-031-21047-1_26openalex-snapshot
Optimization Heuristics for Cost-Efficient Long-Term Cloud Portfolio Allocations
inferred← citeshttps://doi.org/10.1007/978-3-031-23480-4_17openalex-snapshot
Bi-Space Search: Optimizing the Hybridization of Search Spaces in Solving the One Dimensional Bin Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-26504-4_48openalex-snapshot
Scheduling Jobs in Flexible Flow Shops with s-batching Machines Using Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-3-031-28999-6_19openalex-snapshot
Comparative Study of Heuristics for the One-Dimensional Bin Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-61137-7_14openalex-snapshot
Evolutionary Algorithms for Bin Packing Problem with Maximum Lateness and Waste Minimization
inferred← citeshttps://doi.org/10.1007/978-3-031-70068-2_8openalex-snapshot
Evaluating the Robustness of Deep-Learning Algorithm-Selection Models by Evolving Adversarial Instances
inferred← citeshttps://doi.org/10.1007/978-3-031-70595-3_45openalex-snapshot
0/1 1-D Bin Packing Problem Solved by a Recent Nature-Inspired Optimizer
inferred← citeshttps://doi.org/10.1007/978-3-031-90062-4_30openalex-snapshot
The Importance of Being Earnest: Multiple Heterogeneous Container Loading with a Simple Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-032-07175-0_6openalex-snapshot
A Bin-Packing Strategy for Scaling Electricity Consumption in Scenarios with Distributed Generation
inferred← citeshttps://doi.org/10.1007/978-3-319-05170-3_34openalex-snapshot
Characterization of the Optimization Process
inferred← citeshttps://doi.org/10.1007/978-3-319-10762-2_28openalex-snapshot
On the Life-Long Learning Capabilities of a NELLI*: A Hyper-Heuristic Optimisation System
inferred← citeshttps://doi.org/10.1007/978-3-319-10960-2_10openalex-snapshot
Clustering Bin Packing Instances for Generating a Minimal Set of Heuristics by Using Grammatical Evolution
inferred← citeshttps://doi.org/10.1007/978-3-319-33410-3_8openalex-snapshot
Adaptive Cuckoo Search Algorithm for the Bin Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-44394-2_1openalex-snapshot
Exploring Grouping Problems in Industry
inferred← citeshttps://doi.org/10.1007/978-3-319-44394-2_12openalex-snapshot
Modeling Supplier Selection Using Multi-Criterion Fuzzy Grouping Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-44394-2_2openalex-snapshot
Complicating Features in Industrial Grouping Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-44394-2_3openalex-snapshot
Grouping Genetic Algorithms: Advances for Real-World Grouping Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-44394-2_4openalex-snapshot
Fuzzy Grouping Genetic Algorithms: Advances for Real-World Grouping Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-44394-2_6openalex-snapshot
Grouping Learners for Cooperative Learning: Grouping Genetic Algorithm Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-44394-2_9openalex-snapshot
Multi-Criterion Examination Timetabling: A Fuzzy Grouping Genetic Algorithm Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-47054-2_43openalex-snapshot
Generating Bin Packing Heuristic Through Grammatical Evolution Based on Bee Swarm Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-47217-1openalex-snapshot
Computer and Information Sciences
inferred← citeshttps://doi.org/10.1007/978-3-319-47217-1_6openalex-snapshot
A Novel Grouping Genetic Algorithm for the One-Dimensional Bin Packing Problem on GPU
inferred← citeshttps://doi.org/10.1007/978-3-319-50920-4_6openalex-snapshot
Permutation Problems, Genetic Algorithms, and Dynamic Representations
inferred← citeshttps://doi.org/10.1007/978-3-319-65530-7_3openalex-snapshot
Ant Colony Optimization Algorithm for 1D Cutting Stock Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-24581-0_69openalex-snapshot
Guided Operators for a Hyper-Heuristic Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-24652-7_5openalex-snapshot
AntPacking – An Ant Colony Optimization Approach for the One-Dimensional Bin Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_47openalex-snapshot
A Constraint for Bin Packing
inferred← citeshttps://doi.org/10.1007/978-3-540-30499-9_26openalex-snapshot
Packing Bins Using Multi-chromosomal Genetic Representation and Better-Fit Heuristic
inferred← citeshttps://doi.org/10.1007/978-3-540-48584-1_9openalex-snapshot
Metaheuristics for University Course Timetabling
inferred← citeshttps://doi.org/10.1007/978-3-540-71231-2_14openalex-snapshot
A Hyper-Heuristic Framework with XCS: Learning to Create Novel Problem-Solving Algorithms Constructed from Simpler Algorithmic Ingredients
inferred← citeshttps://doi.org/10.1007/978-3-540-71615-0_17openalex-snapshot
Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-74972-1_30openalex-snapshot
Solving Bin Packing Problem with a Hybridization of Hard Computing and Soft Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-78293-3_21openalex-snapshot
An Order Based Memetic Evolutionary Algorithm for Set Partitioning Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-79305-2_11openalex-snapshot
A Study of Evaluation Functions for the Graph K-Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-87700-4_113openalex-snapshot
A Grouping Genetic Algorithm Using Linear Linkage Encoding for Bin Packing
inferred← citeshttps://doi.org/10.1007/978-3-642-01262-4_6openalex-snapshot
Extremal Optimisation for Assignment Type Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-10427-5_24openalex-snapshot
A Hybrid Extremal Optimisation Approach for the Bin Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_13openalex-snapshot
Propagating the Bin Packing Constraint Using Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-20364-0_11openalex-snapshot
Frequency Distribution Based Hyper-Heuristic for the Bin-Packing Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_3openalex-snapshot
Solving Problems with CP: Four Common Pitfalls to Avoid
inferred← citeshttps://doi.org/10.1007/978-3-642-32964-7_35openalex-snapshot
A Hyper-Heuristic Classifier for One Dimensional Bin Packing Problems: Improving Classification Accuracy by Attribute Evolution
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_17openalex-snapshot
Weibull-Based Benchmarks for Bin Packing
inferred← citeshttps://doi.org/10.1007/978-3-642-34859-4_35openalex-snapshot
Solving Graph Coloring Problem by Fuzzy Clustering-Based Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-38679-4_55openalex-snapshot
Improved Swap Heuristic for the Multiple Knapsack Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-61217-6_2openalex-snapshot
An Overview of Evolutionary Algorithms in Management Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-61217-6_8openalex-snapshot
Tapping the Full Power of Genetic Algorithm through Suitable Representation and Local Optimization: Application to Bin Packing
inferred← citeshttps://doi.org/10.1007/978-3-662-44739-0_70openalex-snapshot
An Analogy between Bin Packing Problem and Permutation Problem: A New Encoding Scheme
inferred← citeshttps://doi.org/10.1007/978-94-010-9040-7_13openalex-snapshot
Applying Genetic Algorithms to Workshop Cell Decomposition
inferred← citeshttps://doi.org/10.1007/978-981-10-3728-3_9openalex-snapshot
A Novel Grouping Harmony Search Algorithm for Clustering Problems
inferred← citeshttps://doi.org/10.1007/978-981-19-6613-2_474openalex-snapshot
A Complement Graph Based Heuristic Algorithm for Embedded Register Allocation
inferred← citeshttps://doi.org/10.1007/978-981-95-7081-2_48openalex-snapshot
A Hyper-heuristic Approach to Bi-space Search for Bin Packing Problems
inferred← citeshttps://doi.org/10.1007/978-981-96-2540-6_6openalex-snapshot
XAI for Algorithm Configuration and Selection
inferred← citeshttps://doi.org/10.1007/978-981-96-4288-5_19openalex-snapshot
A Hybrid Multifactorial Evolutionary Algorithm for the Minimum s-Club Cover Problem
inferred← citeshttps://doi.org/10.1007/bfb0056916openalex-snapshot
A new genetic local search algorithm for graph coloring
inferred← citeshttps://doi.org/10.1007/bfb0056929openalex-snapshot
Genetic algorithms for the Multiple Container Packing Problem
inferred← citeshttps://doi.org/10.1007/s00170-010-2572-zopenalex-snapshot
Last two fit augmentation to the well-known construction heuristics for one-dimensional bin-packing problem: an empirical study
inferred← citeshttps://doi.org/10.1007/s00170-013-5515-7openalex-snapshot
Optimization for process plans in sheet metal forming
inferred← citeshttps://doi.org/10.1007/s00170-014-6510-3openalex-snapshot
An efficient genetic algorithm for setup time minimization in PCB assembly
inferred← citeshttps://doi.org/10.1007/s00291-006-0071-2openalex-snapshot
Two heuristics for the one-dimensional bin-packing problem
inferred← citeshttps://doi.org/10.1007/s00500-017-2981-0openalex-snapshot
An improved genetic algorithm encoded by adaptive degressive ary number
inferred← citeshttps://doi.org/10.1007/s00521-025-11270-xopenalex-snapshot
An experimental approach to design deterministic and adaptive control schemes for grouping genetic algorithms
inferred← citeshttps://doi.org/10.1007/s00607-025-01488-xopenalex-snapshot
An energy-aware virtual machine placement method in cloud data centers based on improved Harris Hawks optimization algorithm
inferred← citeshttps://doi.org/10.1007/s00773-021-00842-wopenalex-snapshot
A hybrid algorithm for the variable-sized bin-packing problem of pipe cutting in offshore platform construction
inferred← citeshttps://doi.org/10.1007/s00779-018-1132-7openalex-snapshot
RETRACTED ARTICLE: An improved nature inspired meta-heuristic algorithm for 1-D bin packing problems
inferred← citeshttps://doi.org/10.1007/s10100-020-00695-5openalex-snapshot
A hybrid evolutionary algorithm for the offline Bin Packing Problem
inferred← citeshttps://doi.org/10.1007/s10100-022-00798-1openalex-snapshot
The bin covering with delivery problem, extended investigations for the online case
inferred← citeshttps://doi.org/10.1007/s10100-023-00858-0openalex-snapshot
A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
inferred← citeshttps://doi.org/10.1007/s10107-003-0469-4openalex-snapshot
The integration of an interior-point cutting plane method within a branch-and-price algorithm
inferred← citeshttps://doi.org/10.1007/s10107-020-01523-zopenalex-snapshot
A generic exact solver for vehicle routing and related problems
inferred← citeshttps://doi.org/10.1007/s10115-019-01353-2openalex-snapshot
An intelligence approach for group stock portfolio optimization with a trading mechanism
inferred← citeshttps://doi.org/10.1007/s10288-008-0071-yopenalex-snapshot
The Vertex Coloring Problem and its generalizations
inferred← citeshttps://doi.org/10.1007/s10288-011-0182-8openalex-snapshot
A simulated annealing hyper-heuristic methodology for flexible decision support
inferred← citeshttps://doi.org/10.1007/s10288-017-0365-zopenalex-snapshot
Mathematical models and decomposition algorithms for cutting and packing problems
inferred← citeshttps://doi.org/10.1007/s10479-008-0464-5openalex-snapshot
Nature inspired genetic algorithms for hard packing problems
inferred← citeshttps://doi.org/10.1007/s10479-009-0557-9openalex-snapshot
An exact algorithm for the type-constrained and variable sized bin packing problem
inferred← citeshttps://doi.org/10.1007/s10479-015-1973-7openalex-snapshot
Vector bin packing with heterogeneous bins: application to the machine reassignment problem
inferred← citeshttps://doi.org/10.1007/s10479-015-1976-4openalex-snapshot
Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems
inferred← citeshttps://doi.org/10.1007/s10479-022-04677-5openalex-snapshot
Homogeneous grouping of non-prime steel products for online auctions: a case study
inferred← citeshttps://doi.org/10.1007/s10489-006-0006-2openalex-snapshot
Using genetic algorithms to reorganize superpeer structure in peer to peer networks
inferred← citeshttps://doi.org/10.1007/s10489-014-0582-5openalex-snapshot
A hybrid evolutionary approach to the registration area planning problem
inferred← citeshttps://doi.org/10.1007/s10489-015-0710-xopenalex-snapshot
Cuckoo search based resource optimization of datacenters
inferred← citeshttps://doi.org/10.1007/s10586-019-02956-8openalex-snapshot
A memetic grouping genetic algorithm for cost efficient VM placement in multi-cloud environment
inferred← citeshttps://doi.org/10.1007/s10586-024-04389-4openalex-snapshot
Network-aware virtual machine placement using enriched butterfly optimisation algorithm in cloud computing paradigm
inferred← citeshttps://doi.org/10.1007/s10601-023-09351-6openalex-snapshot
Security-Aware Database Migration Planning
inferred← citeshttps://doi.org/10.1007/s10660-021-09467-yopenalex-snapshot
RETRACTED ARTICLE: An intelligent trading mechanism based on the group trading strategy portfolio to reduce massive loss by the grouping genetic algorithm
inferred← citeshttps://doi.org/10.1007/s10710-025-09528-3openalex-snapshot
A structure-based genetic programming generation constructive hyper-heuristic with transfer learning for combinatorial optimisation
inferred← citeshttps://doi.org/10.1007/s10732-008-9079-xopenalex-snapshot
GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
inferred← citeshttps://doi.org/10.1007/s10732-012-9197-3openalex-snapshot
Bee colony optimization for scheduling independent tasks to identical processors
inferred← citeshttps://doi.org/10.1007/s10732-018-9372-2openalex-snapshot
A study on exponential-size neighborhoods for the bin packing problem with conflicts
inferred← citeshttps://doi.org/10.1007/s10732-018-9375-zopenalex-snapshot
Fast algorithms for fragmentable items bin packing
inferred← citeshttps://doi.org/10.1007/s10732-020-09444-yopenalex-snapshot
Heuristic/meta-heuristic methods for restricted bin packing problem
inferred← citeshttps://doi.org/10.1007/s10766-021-00714-1openalex-snapshot
High-Level Parallel Ant Colony Optimization with Algorithmic Skeletons
inferred← citeshttps://doi.org/10.1007/s10844-006-0242-2openalex-snapshot
Genetic algorithms based approach to database vertical partition
inferred← citeshttps://doi.org/10.1007/s10845-004-5885-7openalex-snapshot
A survey of the self-balancing production lines (?bucket brigades?)
inferred← citeshttps://doi.org/10.1007/s10878-008-9140-6openalex-snapshot
Graph coloring by multiagent fusion search
inferred← citeshttps://doi.org/10.1007/s10898-012-9989-xopenalex-snapshot
Efficient algorithms for the offline variable sized bin-packing problem
inferred← citeshttps://doi.org/10.1007/s10957-012-0122-6openalex-snapshot
Hidden Genes Genetic Optimization for Variable-Size Design Space Problems
inferred← citeshttps://doi.org/10.1007/s11042-015-3096-1openalex-snapshot
RETRACTED ARTICLE: Towards an adaptive human-centric computing resource management framework based on resource prediction and multi-objective genetic algorithm
inferred← citeshttps://doi.org/10.1007/s11227-021-03807-3openalex-snapshot
An energy-efficient cuckoo search algorithm for virtual machine placement in cloud computing data centers
inferred← citeshttps://doi.org/10.1007/s11573-015-0789-xopenalex-snapshot
A grouping genetic algorithm for the Order Batching Problem in distribution warehouses
inferred← citeshttps://doi.org/10.1007/s11573-020-00970-6openalex-snapshot
Bi-criteria parallel batch machine scheduling to minimize total weighted tardiness and electricity cost
inferred← citeshttps://doi.org/10.1007/s11590-008-0097-2openalex-snapshot
Complementary column generation and bounding approaches for set partitioning formulations
inferred← citeshttps://doi.org/10.1007/s11590-013-0607-8openalex-snapshot
Heuristics for the multi-level capacitated minimum spanning tree problem
inferred← citeshttps://doi.org/10.1007/s11590-014-0789-8openalex-snapshot
Characterizing the optimality gap and the optimal packings for the bin packing problem
inferred← citeshttps://doi.org/10.1007/s11590-017-1192-zopenalex-snapshot
BPPLIB: a library for bin packing and cutting stock problems
inferred← citeshttps://doi.org/10.1007/s12293-017-0239-0openalex-snapshot
An efficient grouping genetic algorithm for U-shaped assembly line balancing problems with maximizing production rate
inferred← citeshttps://doi.org/10.1007/s12351-019-00541-wopenalex-snapshot
Simulation and optimization of robotic tasks for UV treatment of diseases in horticulture
inferred← citeshttps://doi.org/10.1007/s13278-014-0155-yopenalex-snapshot
Generalised blockmodelling of social and relational networks using evolutionary computing
inferred← citeshttps://doi.org/10.1007/s43069-020-00047-8openalex-snapshot
Solving Bin Packing Problems Using VRPSolver Models
inferred← citeshttps://doi.org/10.1007/s44196-024-00693-4openalex-snapshot
A Metaheuristic Approach for a Two-dimensional Fuzzy Version of the Variable Size and Cost Bin Packing Problem
inferred← citeshttps://doi.org/10.1016/b978-0-444-53859-8.00004-7openalex-snapshot
Probability Collectives in Optimization
inferred← citeshttps://doi.org/10.1016/j.aei.2025.103572openalex-snapshot
Learning packing-and-unpacking synergistic policy via LLM-guided DRL for robust online robotic packing
inferred← citeshttps://doi.org/10.1016/j.apenergy.2022.119467openalex-snapshot
A mission-driven two-step virtual machine commitment for energy saving of modern data centers through UPS and server coordinated optimizations
inferred← citeshttps://doi.org/10.1016/j.apm.2014.11.001openalex-snapshot
Grouping evolution strategies: An effective approach for grouping problems
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104277openalex-snapshot
Athanor: Local search over abstract constraint specifications
inferred← citeshttps://doi.org/10.1016/j.artint.2025.104405openalex-snapshot
Local-MIP: Efficient local search for mixed integer programming
inferred← citeshttps://doi.org/10.1016/j.artint.2026.104506openalex-snapshot
Domain-independent dynamic programming
inferred← citeshttps://doi.org/10.1016/j.asoc.2014.03.034openalex-snapshot
Haplotype inference using a novel binary particle swarm optimization algorithm
inferred← citeshttps://doi.org/10.1016/j.asoc.2015.01.001openalex-snapshot
Using group genetic algorithm to improve performance of attribute clustering
inferred← citeshttps://doi.org/10.1016/j.asoc.2019.105565openalex-snapshot
A modified squirrel search algorithm based on improved best fit heuristic and operator strategy for bin packing problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2020.106440openalex-snapshot
Memetic search for composing medical crews with equity and efficiency
inferred← citeshttps://doi.org/10.1016/j.asoc.2021.107473openalex-snapshot
An energy aware grouping memetic algorithm to schedule the sensing activity in WSNs-based IoT for smart cities
inferred← citeshttps://doi.org/10.1016/j.asoc.2022.109964openalex-snapshot
Two evolutionary approaches with objective-specific variation operators for vehicle routing problem with time windows and quality of service objectives
inferred← citeshttps://doi.org/10.1016/j.asoc.2026.114659openalex-snapshot
A two-stage solution incorporating large neighborhood search for the priority-aware 2D bin packing problem in furniture manufacturing
inferred← citeshttps://doi.org/10.1016/j.cie.2006.08.018openalex-snapshot
Hybrid procedure to determine optimal workforce without noise hazard exposure
inferred← citeshttps://doi.org/10.1016/j.cie.2007.12.016openalex-snapshot
Superior/Inferior Segment-Discriminated Ant System for combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/j.cie.2011.11.025openalex-snapshot
A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries
inferred← citeshttps://doi.org/10.1016/j.cie.2013.05.016openalex-snapshot
Iterative approaches for solving a multi-objective 2-dimensional vector packing problem
inferred← citeshttps://doi.org/10.1016/j.cie.2014.06.002openalex-snapshot
Optimization of one-dimensional Bin Packing Problem with island parallel grouping genetic algorithms
inferred← citeshttps://doi.org/10.1016/j.cie.2018.08.021openalex-snapshot
Cooperative parallel grouping genetic algorithm for the one-dimensional bin packing problem
inferred← citeshttps://doi.org/10.1016/j.cie.2021.107875openalex-snapshot
Online product allocation in poultry batchers with lookahead
inferred← citeshttps://doi.org/10.1016/j.cie.2023.109179openalex-snapshot
Optimal delivery route planning for a fleet of heterogeneous drones: A rescheduling-based genetic algorithm approach
inferred← citeshttps://doi.org/10.1016/j.cie.2025.111293openalex-snapshot
Open-End Bin Packing Problem with Conflicts
inferred← citeshttps://doi.org/10.1016/j.comnet.2021.108270openalex-snapshot
A network-aware and power-efficient virtual machine placement scheme in cloud datacenters based on chemical reaction optimization
inferred← citeshttps://doi.org/10.1016/j.cor.2005.07.023openalex-snapshot
Heuristic approaches for batching jobs in printed circuit board assembly
inferred← citeshttps://doi.org/10.1016/j.cor.2005.07.028openalex-snapshot
A survey of local search methods for graph coloring
inferred← citeshttps://doi.org/10.1016/j.cor.2006.02.007openalex-snapshot
New bin packing fast lower bounds
inferred← citeshttps://doi.org/10.1016/j.cor.2006.10.021openalex-snapshot
Solving the one-dimensional bin packing problem with a weight annealing heuristic
inferred← citeshttps://doi.org/10.1016/j.cor.2007.03.001openalex-snapshot
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
inferred← citeshttps://doi.org/10.1016/j.cor.2008.09.004openalex-snapshot
A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
inferred← citeshttps://doi.org/10.1016/j.cor.2008.12.016openalex-snapshot
Heuristics for the variable sized bin-packing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2011.08.010openalex-snapshot
A wide-ranging computational comparison of high-performance graph colouring algorithms
inferred← citeshttps://doi.org/10.1016/j.cor.2011.10.009openalex-snapshot
Energy efficient spatial TDMA scheduling in wireless networks
inferred← citeshttps://doi.org/10.1016/j.cor.2014.03.003openalex-snapshot
Fast pattern-based algorithms for cutting stock
inferred← citeshttps://doi.org/10.1016/j.cor.2014.10.010openalex-snapshot
A grouping genetic algorithm with controlled gene transmission for the bin packing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2015.11.009openalex-snapshot
Bin packing and related problems: General arc-flow formulation with graph compression
inferred← citeshttps://doi.org/10.1016/j.cor.2016.06.009openalex-snapshot
Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
inferred← citeshttps://doi.org/10.1016/j.cor.2020.105041openalex-snapshot
Simultaneously exploiting two formulations: An exact benders decomposition approach
inferred← citeshttps://doi.org/10.1016/j.cor.2020.105113openalex-snapshot
Bin Packing Problem with Conflicts and Item Fragmentation
inferred← citeshttps://doi.org/10.1016/j.cor.2022.105759openalex-snapshot
Modelling and solving the milk collection problem with realistic constraints
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106860openalex-snapshot
Classification and evaluation of the algorithms for vector bin packing
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.018openalex-snapshot
Solving vertex coloring problems as maximum weight stable set problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2005.06.002openalex-snapshot
Fast lifting procedures for the bin packing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.07.022openalex-snapshot
State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.08.036openalex-snapshot
A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.07.016openalex-snapshot
A memetic algorithm for graph coloring
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.11.004openalex-snapshot
Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.03.016openalex-snapshot
An investigation into two bin packing problems with ordering and orientation implications
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.01.007openalex-snapshot
A binary particle swarm optimization algorithm inspired by multi-level organizational learning behavior
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.07.024openalex-snapshot
New developments in the primal–dual column generation technique
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.09.015openalex-snapshot
The freight consolidation and containerization problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.04.030openalex-snapshot
Bin packing and cutting stock problems: Mathematical models and exact algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.10.043openalex-snapshot
Mathematical models and decomposition methods for the multiple knapsack problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.07.023openalex-snapshot
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.05.041openalex-snapshot
Solving robust bin-packing problems with a branch-and-price approach
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.01.028openalex-snapshot
Exact and approximate methods for the score-constrained packing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.02.014openalex-snapshot
A MILP model and two heuristics for the Bin Packing Problem with Conflicts and Item Fragmentation
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.08.007openalex-snapshot
Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation
inferred← citeshttps://doi.org/10.1016/j.engappai.2004.08.024openalex-snapshot
Evaluating performance advantages of grouping genetic algorithms
showing the first 200 of 555 · page through all 555
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.