On the public citation graph

Obtaining test problems via Internet

https://doi.org/10.1007/bf02404002
0 signed · 111 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.1016/0956-053x(94)90059-0openalex-snapshot
The whole internet user's guide and catalog

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.4693541openalex-extracted
Non-Dominated Tournament Genetic Algorithm (Ntga2) for Multi-Objective Constrained Portfolio Optimisation on Global Market
inferred← citeshttps://doi.org/10.1007/11499305_7openalex-snapshot
An Evolutionary Strategy for the Multidimensional 0-1 Knapsack Problem Based on Genetic Computation of Surrogate Multipliers
inferred← citeshttps://doi.org/10.1007/11730095_22openalex-snapshot
A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems
inferred← citeshttps://doi.org/10.1007/11881216_3openalex-snapshot
A Flipping Local Search Genetic Algorithm for the Multidimensional 0-1 Knapsack Problem
inferred← citeshttps://doi.org/10.1007/3-540-36477-3_11openalex-snapshot
The Aircraft Sequencing Problem
inferred← citeshttps://doi.org/10.1007/3-540-44867-5_13openalex-snapshot
Experimental Comparison of Heuristic and Approximation Algorithms for Uncapacitated Facility Location
inferred← citeshttps://doi.org/10.1007/978-0-387-34747-9_51openalex-snapshot
Solving multi-objective scheduling problems—An integrated systems approach
inferred← citeshttps://doi.org/10.1007/978-0-387-74905-1_4openalex-snapshot
Multiple-Colony Ant Algorithm with Forward–Backward Scheduling Approach for Job-Shop Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-0-85729-338-1_16openalex-snapshot
Evolutionary Simulated Annealing Algorithms for Uncapacitated Facility Location Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3613-7_9openalex-snapshot
A Global Optimization Heuristic for Portfolio Choice with VaR and Expected Shortfall
inferred← citeshttps://doi.org/10.1007/978-3-031-04520-2_9openalex-snapshot
Metaheuristic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-69404-7_35openalex-snapshot
Emmental-Type GKLS-Based Multiextremal Smooth Test Problems with Non-linear Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-78761-7_61openalex-snapshot
Computing Surrogate Constraints for Multidimensional Knapsack Problems Using Evolution Strategies
inferred← citeshttps://doi.org/10.1007/978-3-540-78985-7_6openalex-snapshot
Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-89619-7_15openalex-snapshot
GA Inspired Heuristic for Uncapacitated Single Allocation Hub Location Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-03211-0_24openalex-snapshot
On the Performance of Homogeneous and Heterogeneous Cooperative Search Strategies
inferred← citeshttps://doi.org/10.1007/978-3-642-11169-3_15openalex-snapshot
Cooperative Strategies and Reactive Search: A Hybrid Model Proposal
inferred← citeshttps://doi.org/10.1007/978-3-642-11282-9_9openalex-snapshot
A New Evolutionary Based Approach for Solving the Uncapacitated Multiple Allocation p-Hub Median Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-12139-5_14openalex-snapshot
A Study of Memetic Search with Multi-parent Combination for UBQP
inferred← citeshttps://doi.org/10.1007/978-3-642-12538-6_3openalex-snapshot
Using Knowledge Discovery in Cooperative Strategies: Two Case Studies
inferred← citeshttps://doi.org/10.1007/978-3-642-17022-5_33openalex-snapshot
Evolutionary Algorithms and the Cardinality Constrained Portfolio Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-29828-8_26openalex-snapshot
A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization
inferred← citeshttps://doi.org/10.1007/s00500-005-0044-4openalex-snapshot
Main Effect Fine-tuning of the Mutation Operator and the Neighbourhood Function for Uncapacitated Facility Location Problems
inferred← citeshttps://doi.org/10.1007/s00500-012-0919-0openalex-snapshot
An efficient memetic algorithm for the uncapacitated single allocation hub location problem
inferred← citeshttps://doi.org/10.1007/s10288-009-0115-yopenalex-snapshot
Diversification-driven tabu search for unconstrained binary quadratic problems
inferred← citeshttps://doi.org/10.1007/s10288-018-0372-8openalex-snapshot
The multiplicative weights update algorithm for mixed integer nonlinear programming: theory, applications, and limitations
inferred← citeshttps://doi.org/10.1007/s10479-017-2508-1openalex-snapshot
Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems
inferred← citeshttps://doi.org/10.1007/s10479-024-06358-xopenalex-snapshot
A near-linear time algorithm and a min-cost flow approach for determining the optimal landing times of a fixed sequence of planes
inferred← citeshttps://doi.org/10.1007/s10589-007-9154-5openalex-snapshot
Computing the metric dimension of graphs by genetic algorithms
inferred← citeshttps://doi.org/10.1007/s10845-009-0294-6openalex-snapshot
A two-stage genetic algorithm for multi-objective job shop scheduling problems
inferred← citeshttps://doi.org/10.1007/s10845-010-0435-yopenalex-snapshot
Coordinating metaheuristic agents with swarm intelligence
inferred← citeshttps://doi.org/10.1007/s10898-009-9507-yopenalex-snapshot
An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs
inferred← citeshttps://doi.org/10.1007/s11590-010-0188-8openalex-snapshot
New formulations of the multiple sequence alignment problem
inferred← citeshttps://doi.org/10.1007/s11590-016-1036-2openalex-snapshot
Solving the robust two-stage capacitated facility location problem with uncertain transportation costs
inferred← citeshttps://doi.org/10.1007/s12293-015-0172-zopenalex-snapshot
Sequence searching and evaluation: a unified approach for aircraft arrival sequencing and scheduling problems
inferred← citeshttps://doi.org/10.1007/s12597-014-0190-5openalex-snapshot
Metaheuristic applications on discrete facility location problems: a survey
inferred← citeshttps://doi.org/10.1007/s13675-016-0069-8openalex-snapshot
A multiplicative weights update algorithm for MINLP
inferred← citeshttps://doi.org/10.1016/j.amc.2006.11.090openalex-snapshot
Iterated tabu search for the maximum diversity problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2011.01.046openalex-snapshot
Solving job shop scheduling problem using a hybrid parallel micro genetic algorithm
inferred← citeshttps://doi.org/10.1016/j.asoc.2015.04.018openalex-snapshot
A hybridization of an evolutionary algorithm and a parallel branch and bound for solving the capacitated single allocation hub location problem
inferred← citeshttps://doi.org/10.1016/j.cie.2010.09.012openalex-snapshot
A parallel local search approach to solving the uncapacitated warehouse location problem
inferred← citeshttps://doi.org/10.1016/j.cie.2016.06.025openalex-snapshot
A parallel artificial bee colony algorithm for the job shop scheduling problem with a dynamic migration strategy
inferred← citeshttps://doi.org/10.1016/j.cie.2017.06.017openalex-snapshot
The robust uncapacitated multiple allocation p -hub median problem
inferred← citeshttps://doi.org/10.1016/j.cor.2008.08.002openalex-snapshot
Computing minimal doubly resolving sets of graphs
inferred← citeshttps://doi.org/10.1016/j.cor.2008.12.020openalex-snapshot
Variable neighborhood search for the heaviest -subgraph
inferred← citeshttps://doi.org/10.1016/j.cor.2011.12.006openalex-snapshot
Probabilistic GRASP-Tabu Search algorithms for the UBQP problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.06.056openalex-snapshot
Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.09.069openalex-snapshot
Genetic algorithms for solving the discrete ordered median problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.06.039openalex-snapshot
A hybrid metaheuristic approach to solving the UBQP problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.04.018openalex-snapshot
Iterated greedy for the maximum diversity problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.11.011openalex-snapshot
A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.07.012openalex-snapshot
Path relinking for unconstrained binary quadratic programming
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.06.002openalex-snapshot
A hybrid metaheuristic method for the Maximum Diversity Problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.10.064openalex-snapshot
Solving the Aircraft Landing Problem with time discretization approach
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.04.021openalex-snapshot
A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes
inferred← citeshttps://doi.org/10.1016/j.eswa.2012.01.064openalex-snapshot
WITHDRAWN: Adaptive GRASP for the Maximum Diversity Problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.114968openalex-snapshot
Squirrel search algorithm for portfolio optimization
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.125611openalex-snapshot
A new parallel cooperative landscape smoothing algorithm and its applications on TSP and UBQP
inferred← citeshttps://doi.org/10.1016/j.knosys.2020.106366openalex-snapshot
Heuristic algorithms based on deep reinforcement learning for quadratic unconstrained binary optimization
inferred← citeshttps://doi.org/10.1016/j.phpro.2015.07.102openalex-snapshot
Extremal Optimization for Quadratic Unconstrained Binary Problems
inferred← citeshttps://doi.org/10.1016/j.rico.2026.100784openalex-snapshot
A hybrid deep learning and meta-heuristics framework for financial portfolio optimization considering practical constraints: A case study of the Egyptian stock market
inferred← citeshttps://doi.org/10.1016/s0305-0548(99)00074-xopenalex-snapshot
Heuristics for cardinality constrained portfolio optimisation
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00425-3openalex-snapshot
An evolutionary heuristic for the index tracking problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(03)00139-5openalex-snapshot
A population heuristic for constrained two-dimensional non-guillotine cutting
inferred← citeshttps://doi.org/10.1016/s0377-2217(03)00247-9openalex-snapshot
A simple tabu search for warehouse location
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00113-1openalex-snapshot
Deterministic job-shop scheduling: Past, present and future
inferred← citeshttps://doi.org/10.1023/a:1008668508685openalex-snapshot
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
inferred← citeshttps://doi.org/10.1023/a:1009642405419openalex-snapshot
A Genetic Algorithm for the Multidimensional Knapsack Problem
inferred← citeshttps://doi.org/10.1023/b:anor.0000039522.58036.68openalex-snapshot
Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem
inferred← citeshttps://doi.org/10.1023/b:heur.0000026265.47626.23openalex-snapshot
An Iterative Construction Heuristic for the Ore Selection Problem
inferred← citeshttps://doi.org/10.1023/b:heur.0000026896.44360.f9openalex-snapshot
A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems
inferred← citeshttps://doi.org/10.1038/s41598-024-71193-wopenalex-snapshot
An adapted Black Widow Optimization Algorithm for Financial Portfolio Optimization Problem with cardinalty and budget constraints
inferred← citeshttps://doi.org/10.1051/ro:2001107openalex-snapshot
Solving the simple plant location problem by genetic algorithm
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601650openalex-snapshot
Displacement problem and dynamically scheduling aircraft landings
inferred← citeshttps://doi.org/10.1061/(asce)0733-9437(2004)130:1(17)openalex-snapshot
Irrigation Scheduling. II: Heuristics Approach
inferred← citeshttps://doi.org/10.1080/00207540600621003openalex-snapshot
Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
inferred← citeshttps://doi.org/10.1080/0305215x.2016.1275605openalex-snapshot
An extended continuous estimation of distribution algorithm for solving the permutation flow-shop scheduling problem
inferred← citeshttps://doi.org/10.1093/imaman/dpw008openalex-snapshot
A variable neighbourhood search method for solving the long-term care facility location problem
inferred← citeshttps://doi.org/10.1103/physrevresearch.1.033142openalex-snapshot
Analysis of the relation between quadratic unconstrained binary optimization and the spin-glass ground-state problem
inferred← citeshttps://doi.org/10.1109/3pgcic.2010.49openalex-snapshot
Swarms of Metaheuristic Agents: A Model for Collective intelligence
inferred← citeshttps://doi.org/10.1109/cec.1999.781987openalex-snapshot
Weight-codings in a genetic algorithm for the multi-constraint knapsack problem
inferred← citeshttps://doi.org/10.1109/cec.2004.1331138openalex-snapshot
Parameterisation of mutation in evolutionary algorithms using the estimated main effect of genes
inferred← citeshttps://doi.org/10.1109/cec.2006.1688603openalex-snapshot
Selection of Optimal Investment Portfolios with Cardinality Constraints
inferred← citeshttps://doi.org/10.1109/cec.2017.7969360openalex-snapshot
A Parallel Tabu Search for the Unconstrained Binary Quadratic Programming problem
inferred← citeshttps://doi.org/10.1109/cec60901.2024.10612165openalex-snapshot
On the Effects of Smoothing Rugged Landscape by Different Toy Problems: A Case Study on UBQP
inferred← citeshttps://doi.org/10.1109/iccitechn.2012.6509758openalex-snapshot
A CLONALG-based approach for the set covering problem
inferred← citeshttps://doi.org/10.1109/icdim.2010.5664656openalex-snapshot
Collaboration of heterogenous metaheuristic agents
inferred← citeshttps://doi.org/10.1109/icec.1998.699502openalex-snapshot
An improved genetic algorithm for the multiconstrained 0-1 knapsack problem
inferred← citeshttps://doi.org/10.1109/iciis.1999.810230openalex-snapshot
Cooperative model for genetic operators to improve GAs
inferred← citeshttps://doi.org/10.1109/icsmc.2000.886605openalex-snapshot
Improved distributed genetic algorithm with cooperative-competitive genetic operators
inferred← citeshttps://doi.org/10.1109/socc56010.2022.9908082openalex-snapshot
Cardinality Constrained Portfolio Optimization on an Ising Machine
inferred← citeshttps://doi.org/10.1109/taai.2010.57openalex-snapshot
An Estimation of Distribution Algorithm Based Portfolio Selection Approach
inferred← citeshttps://doi.org/10.1109/tevc.2021.3139263openalex-snapshot
A Generator of Multiextremal Test Classes With Known Solutions for Black-Box-Constrained Global Optimization
inferred← citeshttps://doi.org/10.1109/uksim.2014.25openalex-snapshot
Upgraded Firefly Algorithm for Portfolio Optimization Problem
inferred← citeshttps://doi.org/10.1111/itor.12541openalex-snapshot
Complex portfolio selection via convex mixed‐integer quadratic programming: a survey
inferred← citeshttps://doi.org/10.1142/s0219622014500692openalex-snapshot
On Set Covering Based on Biclustering
inferred← citeshttps://doi.org/10.1142/s1469026808002211openalex-snapshot
GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS
inferred← citeshttps://doi.org/10.1145/1389095.1389215openalex-snapshot
An evolutionary algorithm for some cases of the single-source constrained plant location problem
inferred← citeshttps://doi.org/10.1162/106365602317301772openalex-snapshot
Genetic Programming over Context-Free Languages with Linear Constraints for the Knapsack Problem: First Results
inferred← citeshttps://doi.org/10.1162/106365605774666886openalex-snapshot
Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem
inferred← citeshttps://doi.org/10.1287/trsc.34.2.180.12302openalex-snapshot
Scheduling Aircraft Landings—The Static Case
inferred← citeshttps://doi.org/10.15388/informatica.2006.138openalex-snapshot
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem
inferred← citeshttps://doi.org/10.15388/informatica.2014.23openalex-snapshot
Memetic Algorithm for Solving the Multilevel Uncapacitated Facility Location Problem
inferred← citeshttps://doi.org/10.2298/yjor0802143kopenalex-snapshot
Computing strong metric dimension of some special classes of graphs by genetic algorithms
inferred← citeshttps://doi.org/10.2298/yjor130702032mopenalex-snapshot
Metaheuristic approaches to solving large-scale Bilevel Uncapacitated Facility Location Problem with clients' preferences
inferred← citeshttps://doi.org/10.32657/10356/48091openalex-snapshot
A generic bee colony optimization framework for combinatorial optimization problems
inferred← citeshttps://doi.org/10.3923/jas.2010.1991.2000openalex-snapshot
A New Machine Learning based Approach for Tuning Metaheuristics for the Solution of Hard Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.5755/j01.itc.41.1.1115openalex-snapshot
AN EFFICIENT EVOLUTIONARY ALGORITHM FOR LOCATING LONG-TERM CARE FACILITIES
inferred← citeshttps://doi.org/10.59254/sbpo-2019-106918openalex-snapshot
DESENHO DE REDES DE CONCENTRADORES USANDO MATHEURÍSTICAS
inferred← citeshttps://doi.org/10.70675/cd2b5b77z623ez4977z9af2zf3a0ed90231aopenalex-snapshot
The Multiplicative Weights Update Algorithm for Mixed Integer NonLinear Programming : Theory, Applications, and Limitations
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.