On the public citation graph
E ASY L OCAL++ : an object‐oriented framework for the flexible design of local‐search algorithms
0 signed · 124 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/(sici)1097-024x(200003)30:3<233::aid-spe297>3.0.co;2-kopenalex-snapshot
LOCAL++: A C++ framework for local search algorithms
inferredcites →https://doi.org/10.1002/(sici)1097-024x(200003)30:3<233::aid-spe297>3.3.co;2-bopenalex-snapshot
LOCAL++: A C++ framework for local search algorithms
inferredcites →https://doi.org/10.1002/1097-024x(200009)30:11<1325::aid-spe342>3.0.co;2-topenalex-snapshot
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
inferredcites →https://doi.org/10.1007/0-306-48126-x_3openalex-snapshot
A Framework for Local Search Heuristics for Combinatorial Optimization Problems
inferredcites →https://doi.org/10.1007/0-306-48126-x_4openalex-snapshot
Hotframe: A Heuristic Optimization Framework
inferredcites →https://doi.org/10.1007/0-306-48126-x_5openalex-snapshot
Writing Local Search Algorithms Using Easylocal++
inferredcites →https://doi.org/10.1007/0-306-48126-x_6openalex-snapshot
Integrating Heuristic Search and One-Way Constraints in the Iopt Toolkit
inferredcites →https://doi.org/10.1007/3-540-45066-1openalex-snapshot
Discrete Mathematics and Theoretical Computer Science
inferredcites →https://doi.org/10.1007/3-540-49481-2_23openalex-snapshot
Salsa: A Language for Search Algorithms
inferredcites →https://doi.org/10.1007/978-1-4615-5775-3openalex-snapshot
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
inferredcites →https://doi.org/10.1007/978-1-4615-5775-3_30openalex-snapshot
An Introduction to Variable Neighborhood Search
inferredcites →https://doi.org/10.1007/978-3-642-58409-1_21openalex-snapshot
Building Reusable Software Components for Heuristic Search
inferredcites →https://doi.org/10.1007/b101931openalex-snapshot
Optimization Software Class Libraries
inferredcites →https://doi.org/10.1007/bfb0017443openalex-snapshot
Localizer A modeling language for local search
inferredcites →https://doi.org/10.1016/s0305-0548(97)00093-2openalex-snapshot
A local search template
inferredcites →https://doi.org/10.1090/dimacs/026openalex-snapshot
Cliques, Coloring, and Satisfiability
inferredcites →https://doi.org/10.1090/dimacs/026/29openalex-snapshot
Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/32.58788openalex-snapshot
KIDS: a semiautomatic program development system
inferredcites →https://doi.org/10.1109/3468.769755openalex-snapshot
Local search techniques for large high school timetabling problems
inferredcites →https://doi.org/10.1145/211782.211824openalex-snapshot
Automated support for software development with frameworks
inferredcites →https://doi.org/10.1145/223427.211824openalex-snapshot
Automated support for software development with frameworks
inferredcites →https://doi.org/10.1287/ijoc.9.1.61openalex-snapshot
Toward a Taxonomy of Parallel Tabu Search Heuristics
inferredcites →https://doi.org/10.1287/mnsc.40.10.1276openalex-snapshot
A Tabu Search Heuristic for the Vehicle Routing Problem
inferredcites →https://doi.org/10.1287/opre.37.6.865openalex-snapshot
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
inferredcites →https://doi.org/10.1287/opre.39.3.378openalex-snapshot
Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
inferredcites →https://doi.org/10.1287/opre.44.2.347openalex-snapshot
An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.2459openalex-snapshot
JAMES: An object‐oriented Java framework for discrete optimization using local search metaheuristics
inferred← citeshttps://doi.org/10.1007/0-387-25383-1_7openalex-snapshot
Theory and Practice of the Minimum Shift Design Problem
inferred← citeshttps://doi.org/10.1007/0-387-25383-1_9openalex-snapshot
A Generic Object-Oriented Tabu Search Framework
inferred← citeshttps://doi.org/10.1007/11593577_2openalex-snapshot
Semantic Components for Timetabling
inferred← citeshttps://doi.org/10.1007/11890584_9openalex-snapshot
Hybrid Approaches for Rostering: A Case Study in the Integration of Constraint Programming and Local Search
inferred← citeshttps://doi.org/10.1007/978-1-4419-1306-7_1openalex-snapshot
Metaheuristics: Intelligent Problem Solving
inferred← citeshttps://doi.org/10.1007/978-1-4757-4137-7_11openalex-snapshot
HSF: The iOpt’s Framework to Easily Design Metaheuristic Methods
inferred← citeshttps://doi.org/10.1007/978-3-031-26504-4_3openalex-snapshot
Metaheuristic Algorithms for UAV Trajectory Optimization in Mobile Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_8openalex-snapshot
Interactive Design of Sustainable Cities with a Distributed Local Search Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-17530-0_3openalex-snapshot
Easy and Concise Programming for Low-Level Hybridization of PSO-GA
inferred← citeshttps://doi.org/10.1007/978-3-319-22183-0_9openalex-snapshot
Haiku - a Scala Combinator Toolkit for Semi-automated Composition of Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-3-319-58253-5_3openalex-snapshot
Combining Neighborhoods into Local Search Strategies
inferred← citeshttps://doi.org/10.1007/978-3-319-91086-4_17openalex-snapshot
Automated Design of Metaheuristic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-93031-2_9openalex-snapshot
Reasoning on Sequences in Constraint-Based Local Search Frameworks
inferred← citeshttps://doi.org/10.1007/978-3-319-93375-7_9openalex-snapshot
Quality of Care Driven Scheduling of Clinical Pathways Under Resource and Ethical Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-45157-0_17openalex-snapshot
Multi-neighbourhood Local Search with Application to Course Timetabling
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_77openalex-snapshot
INCOP: An Open Library for INcomplete Combinatorial OPtimization
inferred← citeshttps://doi.org/10.1007/978-3-540-70928-2_52openalex-snapshot
On the Interactive Resolution of Multi-objective Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_4openalex-snapshot
Hybrid Local Search for Constrained Financial Portfolio Selection Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-74446-7_13openalex-snapshot
EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-74446-7_6openalex-snapshot
EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-75514-2_5openalex-snapshot
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-79438-7_6openalex-snapshot
Market Based Allocation of Transportation Orders to Vehicles in Adaptive Multi-objective Vehicle Routing
inferred← citeshttps://doi.org/10.1007/978-3-540-85863-8_18openalex-snapshot
A Parallel Plugin-Based Framework for Multi-objective Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-88439-2_11openalex-snapshot
Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_69openalex-snapshot
Compiling and Executing Declarative Modeling Languages to Gecode
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_81openalex-snapshot
On the Hybridization of Constraint Programming and Local Search Techniques: Models and Software Tools
inferred← citeshttps://doi.org/10.1007/978-3-642-04918-7_11openalex-snapshot
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +
inferred← citeshttps://doi.org/10.1007/978-3-642-04918-7_12openalex-snapshot
Multi-neighborhood Local Search for the Patient Admission Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-11169-3_6openalex-snapshot
Flexible Stochastic Local Search for Haplotype Inference
inferred← citeshttps://doi.org/10.1007/978-3-642-16054-7_4openalex-snapshot
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-17578-7_22openalex-snapshot
Software Framework for Flexible User Defined Metaheuristic Hybridization
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_49openalex-snapshot
Kangaroo: An Efficient Constraint-Based Local Search System Using Lazy Propagation
inferred← citeshttps://doi.org/10.1007/978-3-642-25566-3_34openalex-snapshot
Local Search for Constrained Financial Portfolio Selection Problems with Short Sellings
inferred← citeshttps://doi.org/10.1007/978-3-642-25566-3_48openalex-snapshot
Hyperion – A Recursive Hyper-Heuristic Framework
inferred← citeshttps://doi.org/10.1007/978-3-642-30448-4_2openalex-snapshot
Constraint Propagation as the Core of Local Search
inferred← citeshttps://doi.org/10.1007/978-3-642-30671-6_15openalex-snapshot
A Multi-paradigm Tool for Large Neighborhood Search
inferred← citeshttps://doi.org/10.1007/s00291-012-0290-7openalex-snapshot
OREX-J: towards a universal software framework for the experimental analysis of optimization algorithms
inferred← citeshttps://doi.org/10.1007/s00500-011-0754-8openalex-snapshot
Metaheuristic optimization frameworks: a survey and benchmarking
inferred← citeshttps://doi.org/10.1007/s00500-020-05411-8openalex-snapshot
Framework selection for developing optimization algorithms: assessing preferences by conjoint analysis and best–worst method
inferred← citeshttps://doi.org/10.1007/s10288-011-0165-9openalex-snapshot
LocalSolver 1.x: a black-box local-search solver for 0-1 programming
inferred← citeshttps://doi.org/10.1007/s10472-020-09704-4openalex-snapshot
Real-time solving of computationally hard problems using optimal algorithm portfolios
inferred← citeshttps://doi.org/10.1007/s10479-007-0221-1openalex-snapshot
The minimum shift design problem
inferred← citeshttps://doi.org/10.1007/s10479-013-1358-8openalex-snapshot
The generalized balanced academic curriculum problem with heterogeneous classes
inferred← citeshttps://doi.org/10.1007/s10479-015-2061-8openalex-snapshot
Feature-based tuning of single-stage simulated annealing for examination timetabling
inferred← citeshttps://doi.org/10.1007/s10479-016-2175-7openalex-snapshot
Modeling and solving a real-life multi-skill shift design problem
inferred← citeshttps://doi.org/10.1007/s10479-018-2816-0openalex-snapshot
The Second International Nurse Rostering Competition
inferred← citeshttps://doi.org/10.1007/s10732-006-9007-xopenalex-snapshot
A composite-neighborhood tabu search approach to the traveling tournament problem
inferred← citeshttps://doi.org/10.1007/s10732-011-9158-2openalex-snapshot
The balanced academic curriculum problem revisited
inferred← citeshttps://doi.org/10.1007/s10732-013-9228-8openalex-snapshot
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
inferred← citeshttps://doi.org/10.1007/s10852-005-9032-zopenalex-snapshot
Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems
inferred← citeshttps://doi.org/10.1007/s10951-008-0077-5openalex-snapshot
A survey of search methodologies and automated system development for examination timetabling
inferred← citeshttps://doi.org/10.1007/s10951-010-0213-xopenalex-snapshot
Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs
inferred← citeshttps://doi.org/10.1007/s11741-004-0069-4openalex-snapshot
A multiple-neighborhood-based parallel composite local search algorithm for timetable problem
inferred← citeshttps://doi.org/10.1007/s12293-009-0022-yopenalex-snapshot
Evolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic framework
inferred← citeshttps://doi.org/10.1007/s12293-012-0083-1openalex-snapshot
An algorithm development environment for problem-solving: software review
inferred← citeshttps://doi.org/10.1007/s12559-013-9201-8openalex-snapshot
Searching the Hyper-heuristic Design Space
inferred← citeshttps://doi.org/10.1007/s42979-022-01120-1openalex-snapshot
Defining Parallel Local Search Procedures with Neighborhood Combinators
inferred← citeshttps://doi.org/10.1016/j.artmed.2012.09.001openalex-snapshot
Modeling and solving the dynamic patient admission scheduling problem under uncertainty
inferred← citeshttps://doi.org/10.1016/j.asoc.2018.06.050openalex-snapshot
Hybrid metaheuristics and multi-agent systems for solving optimization problems: A review of frameworks and a comparative analysis
inferred← citeshttps://doi.org/10.1016/j.cie.2013.07.025openalex-snapshot
Local search techniques for a routing-packing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2011.01.007openalex-snapshot
Local search and lower bounds for the patient admission scheduling problem
inferred← citeshttps://doi.org/10.1016/j.cor.2011.09.014openalex-snapshot
Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.05.042openalex-snapshot
Metaheuristics “In the Large”
inferred← citeshttps://doi.org/10.1016/j.eswa.2019.04.056openalex-snapshot
A reinforcement learning-based multi-agent framework applied for solving routing and scheduling problems
inferred← citeshttps://doi.org/10.1016/j.jalgor.2008.02.004openalex-snapshot
Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.11.006openalex-snapshot
Grid computing for parallel bioinspired algorithms
inferred← citeshttps://doi.org/10.1016/j.physrep.2016.08.001openalex-snapshot
Modern meta-heuristics based on nonlinear physics processes: A review of models and design procedures
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1017/s1471068406002857openalex-snapshot
Combining relational algebra, SQL, constraint modelling, and local search
inferred← citeshttps://doi.org/10.1080/14697680903460168openalex-snapshot
Hybrid metaheuristics for constrained portfolio selection problems
inferred← citeshttps://doi.org/10.1080/18756891.2015.1046324openalex-snapshot
A Walk into Metaheuristics for Engineering Optimization: Principles, Methods and Recent Trends
inferred← citeshttps://doi.org/10.1109/bracis.2015.64openalex-snapshot
A Multi-agent Metaheuristic Optimization Framework with Cooperation
inferred← citeshttps://doi.org/10.1109/cec.2018.8477924openalex-snapshot
Toolkit for the Automatic Comparison of Optimizers: Comparing Large-Scale Global Optimizers Made Easy
inferred← citeshttps://doi.org/10.1109/his.2008.102openalex-snapshot
Towards a Highly Scalable Hybrid Metaheuristic for Haplotype Inference Under Parsimony
inferred← citeshttps://doi.org/10.1109/isda.2012.6416523openalex-snapshot
VisualJCLEC: A visual framework for evolutionary computation
inferred← citeshttps://doi.org/10.1109/pdp.2007.11openalex-snapshot
A Parallel Skeleton for the Strength Pareto Evolutionary Algorithm 2
inferred← citeshttps://doi.org/10.1109/pic.2010.5687855openalex-snapshot
An algebraic approach to mechanical tabu search algorithm generation
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2007.00578.xopenalex-snapshot
A software framework for fast prototyping of meta‐heuristics hybridization
inferred← citeshttps://doi.org/10.1145/3067695.3082472openalex-snapshot
In hypercubo nigrae capsulae optimum
inferred← citeshttps://doi.org/10.1145/3638530.3654158openalex-snapshot
Local Search Algorithms for the Oven Scheduling Problem
inferred← citeshttps://doi.org/10.1145/3638530.3664140openalex-snapshot
EasyLocal++ a 25-year Perspective on Local Search Frameworks
inferred← citeshttps://doi.org/10.1145/3795095.3805069openalex-snapshot
Assessing Reproducibility in Evolutionary Computation
inferred← citeshttps://doi.org/10.3390/en13236214openalex-snapshot
Extending and Solving the Refrigerated Routing Problem
inferred← citeshttps://doi.org/10.4204/eptcs.306.59openalex-snapshot
Research Report on Automatic Synthesis of Local Search Neighborhood Operators
inferred← citeshttps://doi.org/10.4236/jsea.2012.511102openalex-snapshot
Rapid and Flexible User-Defined Low-Level Hybridization for Metaheuristics Algorithm in Software Framework
inferred← citeshttps://doi.org/10.48550/arxiv.0705.2137openalex-snapshot
Best insertion algorithm for resource-constrained project scheduling problem
inferred← citeshttps://doi.org/10.6688/jise.2010.26.4.5openalex-snapshot
Oriented Networks Design Problem
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.