| Publication | Date of Publication | Type |
|---|
Packing squares independently
Theoretical Computer Science | 2024-12-12 | Paper |
A heuristic algorithm for the drone rural postman problem
Journal of Industrial and Management Optimization | 2024-05-14 | Paper |
An iterated local search for a multi‐period orienteering problem arising in a car patrolling application
Networks | 2024-01-18 | Paper |
An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†
International Transactions in Operational Research | 2023-11-16 | Paper |
An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
INFORMS Journal on Computing | 2022-12-01 | Paper |
An Iterated Dual Substitution Approach for Binary Integer Programming Problems under the Min-Max Regret Criterion
| 2020-12-10 | Paper |
Relaxation heuristics for the set multicover problem with generalized upper bound constraints
Computers \& Operations Research | 2018-07-11 | Paper |
Efficient overlap detection and construction algorithms for the bitmap shape packing problem
Journal of the Operations Research Society of Japan | 2018-05-18 | Paper |
Efficient implementations of construction heuristics for the rectilinear block packing problem
Computers \& Operations Research | 2016-11-10 | Paper |
A partition-based heuristic algorithm for the rectilinear block packing problem
Journal of the Operations Research Society of Japan | 2016-10-27 | Paper |
Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
INFORMS Journal on Computing | 2016-01-25 | Paper |
Enumerating bottom-left stable positions for rectangle placements with overlap
Journal of the Operations Research Society of Japan | 2014-09-09 | Paper |
Recent progress of local search in handling the time window constraints of the vehicle routing problem
Annals of Operations Research | 2013-08-08 | Paper |
Lagrangian-based column generation for the node capacitated in-tree packing problem
Journal of the Operations Research Society of Japan | 2012-12-08 | Paper |
An LP-based heuristic algorithm for the node capacitated in-tree packing problem
Computers \& Operations Research | 2012-11-15 | Paper |
The complexity of the node capacitated in-tree packing problem
Networks | 2012-06-18 | Paper |
An ejection chain approach for the generalized assignment problem
INFORMS Journal on Computing | 2012-06-08 | Paper |
Efficient local search algorithms for the linear ordering problem
International Transactions in Operational Research | 2011-05-20 | Paper |
Efficient branch-and-bound algorithms for weighted MAX-2-SAT
Mathematical Programming. Series A. Series B | 2011-05-11 | Paper |
A fast algorithm for computing a nearly equitable edge coloring with balanced conditions
Journal of Graph Algorithms and Applications | 2011-02-16 | Paper |
Recent progress of local search in handling the time window constraints of the vehicle routing problem
4OR | 2010-12-06 | Paper |
COMPUTING BOUNDS ON RISK-NEUTRAL DISTRIBUTIONS FROM THE OBSERVED PRICES OF CALL OPTIONS
Asia-Pacific Journal of Operational Research | 2010-06-10 | Paper |
Solving the irregular strip packing problem via guided local search for overlap minimization
International Transactions in Operational Research | 2010-01-29 | Paper |
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
Discrete Optimization | 2009-11-23 | Paper |
The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
Computers \& Operations Research | 2009-10-15 | Paper |
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Exact algorithms for the two-dimensional strip packing problem with and without rotations
European Journal of Operational Research | 2009-06-30 | Paper |
A set covering approach for the pickup and delivery problem with general constraints on each route
| 2009-06-11 | Paper |
An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
Discrete Optimization | 2008-10-29 | Paper |
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
Discrete Applied Mathematics | 2008-09-10 | Paper |
New Bounds for the Nearly Equitable Edge Coloring Problem
Algorithms and Computation | 2008-05-27 | Paper |
RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
Journal of the Operations Research Society of Japan | 2008-04-29 | Paper |
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics | 2007-11-29 | Paper |
A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route
Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics | 2007-11-29 | Paper |
Duality in option pricing based on prices of other derivatives
Operations Research Letters | 2007-08-27 | Paper |
The vehicle routing problem with flexible time windows and traveling times
Discrete Applied Mathematics | 2007-01-09 | Paper |
One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
JMMA. Journal of Mathematical Modelling and Algorithms | 2006-09-28 | Paper |
A 3-flip neighborhood local search for the set covering problem
European Journal of Operational Research | 2006-04-28 | Paper |
Heuristic approaches to the capacitated square covering problem
| 2006-02-08 | Paper |
scientific article; zbMATH DE number 5004912 (Why is no real title available?)
| 2006-02-08 | Paper |
A path relinking approach with ejection chains for the generalized assignment problem
European Journal of Operational Research | 2005-10-26 | Paper |
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
Discrete Optimization | 2005-08-22 | Paper |
Improved local search algorithms for the rectangle packing problem with general spatial costs
European Journal of Operational Research | 2005-08-01 | Paper |
A decomposability index in logical analysis of data
Discrete Applied Mathematics | 2004-08-19 | Paper |
scientific article; zbMATH DE number 2080998 (Why is no real title available?)
| 2004-08-04 | Paper |
Local search algorithms for the rectangle packing problem with general spatial costs
Mathematical Programming. Series A. Series B | 2003-09-01 | Paper |
Finding essential attributes from binary data
Annals of Mathematics and Artificial Intelligence | 2003-08-21 | Paper |
One-dimensional cutting stock problem to minimize the number of different patterns
European Journal of Operational Research | 2003-04-10 | Paper |
Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation
Journal of Heuristics | 2002-12-15 | Paper |
Analyses on the 2 and 3-flip neighborhoods for the MAX SAT
Journal of Combinatorial Optimization | 2001-03-04 | Paper |
scientific article; zbMATH DE number 1568135 (Why is no real title available?)
| 2001-02-21 | Paper |
scientific article; zbMATH DE number 1568137 (Why is no real title available?)
| 2001-02-21 | Paper |
scientific article; zbMATH DE number 1568139 (Why is no real title available?)
| 2001-02-21 | Paper |
A variable depth search algorithm with branching search for the generalized assignment problem
Optimization Methods \& Software | 2000-10-29 | Paper |
scientific article; zbMATH DE number 1488098 (Why is no real title available?)
| 2000-08-10 | Paper |
Fast algorithms to enumerate all common intervals of two permutations
Algorithmica | 2000-03-19 | Paper |
scientific article; zbMATH DE number 1377724 (Why is no real title available?)
| 1999-12-14 | Paper |
scientific article; zbMATH DE number 1222824 (Why is no real title available?)
| 1998-11-11 | Paper |
The use of dynamic programming in genetic algorithms for permutation problems
European Journal of Operational Research | 1998-10-18 | Paper |
scientific article; zbMATH DE number 1054928 (Why is no real title available?)
| 1997-08-28 | Paper |
