Saïd Hanafi

From MaRDI portal


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Iterated local search with ejection chains for the space-free multi-row facility layout problem
European Journal of Operational Research
2024-07-02Paper
Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem
International Transactions in Operational Research
2023-11-16Paper
Variable neighborhood search for the single machine scheduling problem to minimize the total early work
Optimization Letters
2023-11-07Paper
Extended formulations for perfect domination problems and their algorithmic implications
European Journal of Operational Research
2023-07-11Paper
Tabu search exploiting local optimality in binary optimization
European Journal of Operational Research
2023-07-10Paper
Municipal Solid Waste Collection: An Effective Data Structure For Solving The Sectorization Problem With Local Search Methods
INFOR: Information Systems and Operational Research
2023-04-21Paper
Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem
European Journal of Operational Research
2022-09-29Paper
On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
Discrete Applied Mathematics
2022-01-05Paper
Bi-objective optimization of biclustering with binary data
Information Sciences
2021-11-23Paper
Heuristic and exact fixation-based approaches for the discounted 0-1 knapsack problem
 
2021-06-07Paper
The single-processor scheduling problem with time restrictions: complexity and related problems
Journal of Scheduling
2020-03-06Paper
The multi-visit team orienteering problem with precedence constraints
European Journal of Operational Research
2020-01-08Paper
A general variable neighbourhood search for the multi-product inventory routing problem
IMA Journal of Management Mathematics
2019-06-18Paper
Two-machine flow shop with synchronized periodic maintenance
RAIRO - Operations Research
2019-06-07Paper
Probabilistic tabu search for the cross-docking assignment problem
European Journal of Operational Research
2019-04-30Paper
Timetable rearrangement to cope with railway maintenance activities
Computers & Operations Research
2018-07-11Paper
A general variable neighborhood search for the swap-body vehicle routing problem
Computers & Operations Research
2018-07-11Paper
Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
European Journal of Operational Research
2018-05-30Paper
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
European Journal of Operational Research
2018-05-25Paper
Variable neighborhood search: basics and variants
EURO Journal on Computational Optimization
2018-03-28Paper
New complexity results on scheduling problem in a robotic cell
RAIRO - Operations Research
2018-02-23Paper
Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
RAIRO - Operations Research
2018-02-23Paper
Clustering approach in maintenance of capillary railway network
 
2018-01-04Paper
A co-opetitive framework for the hub location problems in transportation networks
Optimization
2017-12-15Paper
Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem
Optimization Theory, Decision Making, and Operations Research Applications
2017-11-30Paper
A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
Optimization Letters
2017-11-10Paper
New MIP model for multiprocessor scheduling problem with communication delays
Optimization Letters
2017-11-10Paper
A general variable neighborhood search variants for the travelling salesman problem with draft limits
Optimization Letters
2017-11-10Paper
Mathematical programming based heuristics for the 0--1 MIP: a survey
Journal of Heuristics
2017-09-08Paper
New variable neighborhood search based 0-1 MIP heuristics
Yugoslav Journal of Operations Research
2017-07-19Paper
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
International Transactions in Operational Research
2017-07-13Paper
Three-stage hybrid-flowshop model for cross-docking
Computers & Operations Research
2016-11-14Paper
Variable neighborhood search for location routing
Computers & Operations Research
2016-11-11Paper
A two phase variable neighborhood search for the multi-product inventory routing problem
Computers & Operations Research
2016-11-10Paper
Skewed general variable neighborhood search for the location routing scheduling problem
Computers & Operations Research
2016-11-10Paper
Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance
Computers & Operations Research
2016-11-10Paper
An implementation of exact knapsack separation
Journal of Global Optimization
2016-10-26Paper
Nested general variable neighborhood search for the periodic maintenance problem
European Journal of Operational Research
2016-10-07Paper
A two-stage flow shop scheduling problem with transportation considerations
4OR
2016-01-13Paper
New exact method for large asymmetric distance-constrained vehicle routing problem
European Journal of Operational Research
2014-07-27Paper
An iterated local search for solving a location-routing problem
 
2013-11-08Paper
Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem
 
2013-11-08Paper
A variable neighborhood search for the multi-product inventory routing problem
Electronic Notes in Discrete Mathematics
2013-07-23Paper
VNS based heuristic for solving the unit commitment problem
Electronic Notes in Discrete Mathematics
2013-07-23Paper
An exact algorithm for bilevel 0-1 knapsack problems
Mathematical Problems in Engineering
2013-06-11Paper
Variable neighborhood search for the travelling deliveryman problem
4OR
2013-03-25Paper
One-level reformulation of the bilevel Knapsack problem using dynamic programming
Discrete Optimization
2013-03-13Paper
A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
European Journal of Operational Research
2012-12-29Paper
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
Computers & Operations Research
2012-11-15Paper
The min-conflict packing problem
Computers & Operations Research
2012-11-15Paper
Hybrid approaches for the two-scenario max-min knapsack problem
International Transactions in Operational Research
2012-09-25Paper
Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility
Electronic Notes in Discrete Mathematics
2012-05-13Paper
Convergent tabu search for optimal partitioning
 
2012-01-26Paper
A mathematical programming based procedure for breast cancer classification
JMMA. Journal of Mathematical Modelling and Algorithms
2012-01-02Paper
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
European Journal of Operational Research
2011-08-19Paper
Improved convergent heuristics for the 0-1 multidimensional knapsack problem
Annals of Operations Research
2011-06-08Paper
Tabu search approaches for solving the two-group classification problem
Annals of Operations Research
2011-06-08Paper
A tabu search with an oscillation strategy for the discriminant analysis problem
Computers & Operations Research
2010-06-11Paper
A multi-level search strategy for the 0-1 multidimensional knapsack problem
Discrete Applied Mathematics
2010-05-05Paper
Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
Computers & Operations Research
2010-01-15Paper
An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
European Journal of Operational Research
2009-12-07Paper
A dynamic programming algorithm for the bilevel Knapsack problem
Operations Research Letters
2009-08-14Paper
New convergent heuristics for 0-1 mixed integer programming
European Journal of Operational Research
2009-01-08Paper
A survey of effective heuristics and their application to a variety of knapsack problems
IMA Journal of Management Mathematics
2008-09-09Paper
Scatter search for the 0-1 multidimensional knapsack problem
JMMA. Journal of Mathematical Modelling and Algorithms
2008-06-11Paper
Tabu search: global intensification using dynamic programming
 
2007-05-14Paper
Exploiting nested inequalities and surrogate constraints
European Journal of Operational Research
2007-01-09Paper
Mathematical programming approach to the Petri nets reachability problem
European Journal of Operational Research
2006-12-07Paper
The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Annals of Operations Research
2006-03-07Paper
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Lecture Notes in Computer Science
2005-12-27Paper
Resolution search and dynamic branch-and-bound
Journal of Combinatorial Optimization
2003-06-09Paper
Extension of reverse elimination method through a dynamic management of the tabu list
RAIRO. Operations Research
2002-09-04Paper
An efficient tabu search approach for the 0-1 multidimensional knapsack problem
European Journal of Operational Research
2002-08-18Paper
Tabu search and finite convergence
Discrete Applied Mathematics
2002-06-24Paper
On the convergence of tabu search
Journal of Heuristics
2001-09-03Paper
scientific article; zbMATH DE number 1054949 (Why is no real title available?)
 
1997-10-27Paper


Research outcomes over time


This page was built for person: Saïd Hanafi