Shunji Umetani

Orcid: 0000-0003-2906-9960

According to our database1, Shunji Umetani authored at least 15 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Interpretable Price Bounds Estimation with Shape Constraints in Price Optimization.
CoRR, 2024

2023
Operating Range Estimation for Price Optimization.
Proceedings of the IEEE International Conference on Data Mining, 2023

2022
Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes.
Eur. J. Oper. Res., 2022

2019
An Efficient Branch-and-Cut Algorithm for Approximately Submodular Function Maximization.
Proceedings of the 2019 IEEE International Conference on Systems, Man and Cybernetics, 2019

2018
An efficient branch-and-bound algorithm for submodular function maximization.
CoRR, 2018

Relaxation heuristics for the set multicover problem with generalized upper bound constraints.
Comput. Oper. Res., 2018

2017
Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs.
Eur. J. Oper. Res., 2017

2015
Exploiting Variable Associations to Configure Efficient Local Search in Large-Scale Set Partitioning Problems.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2013
A Heuristic Algorithm for the Set Multicover Problem with Generalized Upper Bound Constraints.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

2011
On the one-dimensional stock cutting problem in the paper tube industry.
J. Sched., 2011

2009
Solving the irregular strip packing problem via guided local search for overlap minimization.
Int. Trans. Oper. Res., 2009

2008
Diversion of Hierarchical Phrases as Reordering Templates.
Proceedings of the 7th NTCIR Workshop Meeting on Evaluation of Information Access Technologies: Information Retrieval, 2008

2006
One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming.
J. Math. Model. Algorithms, 2006

2003
An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

One-dimensional cutting stock problem to minimize the number of different patterns.
Eur. J. Oper. Res., 2003


  Loading...