On the public citation graph

Improved Adaptive Memory Search for Binary Integer Programming

0 signed · 47 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/978-0-387-71921-4_1openalex-snapshot
Experiments Using Scatter Search for the Multidemand Multidimensional Knapsack Problem
inferredcites →https://doi.org/10.1007/978-1-4419-1665-5_21openalex-snapshot
Comparison of Metaheuristics
inferredcites →https://doi.org/10.1007/s10479-009-0597-1openalex-snapshot
The case for strategic oscillation
inferredcites →https://doi.org/10.1007/s10732-014-9266-xopenalex-snapshot
Proximity search for 0-1 mixed-integer convex programming
inferredcites →https://doi.org/10.1007/s10732-021-09466-0openalex-snapshot
Weighted proximity search
inferredcites →https://doi.org/10.1007/s12532-011-0025-9openalex-snapshot
MIPLIB 2010
inferredcites →https://doi.org/10.1007/s12532-023-00234-8openalex-snapshot
Feasibility Jump: an LP-free Lagrangian MIP heuristic
inferredcites →https://doi.org/10.1016/0377-2217(95)00249-9openalex-snapshot
A note on hashing functions and tabu search algorithms
inferredcites →https://doi.org/10.1016/0957-4174(93)90056-copenalex-snapshot
Integrating target analysis and tabu search for improved scheduling systems
inferredcites →https://doi.org/10.1016/j.cor.2010.01.013openalex-snapshot
Black box scatter search for general classes of binary optimization problems
inferredcites →https://doi.org/10.1016/j.cor.2015.10.014openalex-snapshot
Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimization
inferredcites →https://doi.org/10.1016/j.cor.2021.105692openalex-snapshot
Knapsack problems — An overview of recent advances. Part I: Single knapsack problems
inferredcites →https://doi.org/10.1016/j.cor.2021.105693openalex-snapshot
Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems
inferredcites →https://doi.org/10.1016/j.ejco.2022.100028openalex-snapshot
Exponential extrapolation memory for tabu search
inferredcites →https://doi.org/10.1016/j.ejor.2008.08.009openalex-snapshot
The double travelling salesman problem with multiple stacks – Formulation and heuristic solution approaches
inferredcites →https://doi.org/10.1016/j.ejor.2016.10.035openalex-snapshot
Effective metaheuristic algorithms for the minimum differential dispersion problem
inferredcites →https://doi.org/10.1016/j.ejor.2018.10.001openalex-snapshot
Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
inferredcites →https://doi.org/10.1016/j.ejor.2023.01.030openalex-snapshot
The board packing problem
inferredcites →https://doi.org/10.1016/j.orl.2005.07.009openalex-snapshot
MIPLIB 2003
inferredcites →https://doi.org/10.1016/j.orl.2013.08.007openalex-snapshot
Measuring the impact of primal heuristics
inferredcites →https://doi.org/10.1016/j.orp.2021.100182openalex-snapshot
A Novel Core-Based Optimization Framework for Binary Integer Programs- the Multidemand Multidimesional Knapsack Problem as a Test Problem
inferredcites →https://doi.org/10.1016/j.swevo.2011.02.002openalex-snapshot
A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms
inferredcites →https://doi.org/10.1016/s0004-3702(98)00086-1openalex-snapshot
A complete anytime algorithm for number partitioning
inferredcites →https://doi.org/10.1016/s0378-4371(02)00516-2openalex-snapshot
Phase transitions and complexity in computer science: an overview of the statistical physics approach to the random satisfiability problem
inferredcites →https://doi.org/10.1023/a:1023717307746openalex-snapshot
A Heuristic for Boolean Optimization Problems
inferredcites →https://doi.org/10.1080/1055678021000090033openalex-snapshot
Randomized heuristics for the Max-Cut problem
inferredcites →https://doi.org/10.1109/access.2019.2959315openalex-snapshot
A Tabu Search Approach With Dynamical Neighborhood Size for Solving the Maximum Min-Sum Dispersion Problem
inferredcites →https://doi.org/10.1111/itor.70011openalex-snapshot
Solution‐based versus attribute‐based tabu search for binary integer programming
inferredcites →https://doi.org/10.1111/j.1475-3995.2009.00748.xopenalex-snapshot
An exact method for the double TSP with multiple stacks
inferredcites →https://doi.org/10.1137/s1052623497328987openalex-snapshot
A Spectral Bundle Method for Semidefinite Programming
inferredcites →https://doi.org/10.1145/2076450.2076469openalex-snapshot
Programming by optimization
inferredcites →https://doi.org/10.1145/2541012.2541014openalex-snapshot
A fast and scalable multidimensional multiple-choice knapsack heuristic
inferredcites →https://doi.org/10.1145/3572895openalex-snapshot
Instance Space Analysis for Algorithm Testing: Methodology and Software Tools
inferredcites →https://doi.org/10.1201/9781420039597.ch1openalex-snapshot
New Heuristics and Adaptive Memory Procedures for Boolean Optimization Problems
inferredcites →https://doi.org/10.1287/ijoc.1030.0050openalex-snapshot
A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
inferredcites →https://doi.org/10.1287/ijoc.1080.0275openalex-snapshot
Advanced Scatter Search for the Max-Cut Problem
inferredcites →https://doi.org/10.1287/ijoc.1110.0496openalex-snapshot
A New Local Search Algorithm for Binary Optimization
inferredcites →https://doi.org/10.1287/ijoc.6.1.82openalex-snapshot
Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
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/opre.28.5.1130openalex-snapshot
An Algorithm for Large Zero-One Knapsack Problems
inferredcites →https://doi.org/10.13140/rg.2.2.19431.80802openalex-snapshot
Genetic Algorithm for the 0/1 Multidimensional Knapsack Problem
inferredcites →https://doi.org/10.13164/mendel.2020.1.023openalex-snapshot
Combining solutions of the optimum satisfiability problem using evolutionary tunneling
inferredcites →https://doi.org/10.1504/ijmheur.2022.10052729openalex-snapshot
Variable neighbourhood search for binary integer programming problems
inferredcites →https://doi.org/10.2307/4615733openalex-snapshot
A Simple Sequentially Rejective Multiple Test Procedure
inferredcites →https://doi.org/10.4230/lipics.cp.2023.7openalex-snapshot
Exploiting Configurations of MaxSAT Solvers
inferredcites →https://doi.org/10.48550/arxiv.2010.05394openalex-snapshot
Exploiting Local Optimality in Metaheuristic Search
inferredcites →https://doi.org/10.48550/arxiv.2109.09831openalex-snapshot
SMAC3: A Versatile Bayesian Optimization Package for Hyperparameter Optimization
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.