Noriyoshi Sukegawa

Orcid: 0000-0002-3560-0036

According to our database1, Noriyoshi Sukegawa authored at least 22 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Computing Medians of Marked Point Process Data Under Edit Distance.
J. Optim. Theory Appl., January, 2024

2023
Monotone Diameter of Bisubmodular Polyhedra.
Oper. Res. Forum, December, 2023

Predicting Online Item-Choice Behavior: A Shape-Restricted Regression Approach.
Algorithms, 2023

2021
Minimum point-overlap labelling.
Optim. Methods Softw., 2021

2020
Preface: Workshop on Advances in Optimization.
Discret. Appl. Math., 2020

Predicting Online Item-choice Behavior: A Shape-restricted Regression Perspective.
CoRR, 2020

2019
Improving collaborative filtering recommendations by estimating user preferences from clickstream data.
Electron. Commer. Res. Appl., 2019

An Asymptotically Improved Upper Bound on the Diameter of Polyhedra.
Discret. Comput. Geom., 2019

A Simple Projection Algorithm for Linear Programming Problems.
Algorithmica, 2019

2018
A latent-class model for estimating product-choice probabilities from clickstream data.
Inf. Sci., 2018

Exact Clustering via Integer Programming and Maximum Satisfiability.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Improving bounds on the diameter of a polyhedron in high dimensions.
Discret. Math., 2017

Minimum Point-Overlap Labeling.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Estimating product-choice probabilities from recency and frequency of page views.
Knowl. Based Syst., 2016

2015
A refinement of Todd's bound for the diameter of a polyhedron.
Oper. Res. Lett., 2015

A primal-simplex based Tardos' algorithm.
Oper. Res. Lett., 2015

Maximizing Barber's bipartite modularity is also hard.
Optim. Lett., 2015

Redundant constraints in the standard formulation for the clique partitioning problem.
Optim. Lett., 2015

Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs.
Comput. Manag. Sci., 2015

2014
Fractional programming formulation for the vertex coloring problem.
Inf. Process. Lett., 2014

2013
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number.
Discret. Optim., 2013

Lagrangian relaxation and pegging test for the clique partitioning problem.
Adv. Data Anal. Classif., 2013


  Loading...