Noriyoshi Sukegawa

From MaRDI portal
Revision as of 12:44, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:402374

Available identifiers

zbMath Open sukegawa.noriyoshiMaRDI QIDQ402374

List of research outcomes





PublicationDate of PublicationType
Robust portfolio optimization model for electronic coupon allocation2024-12-20Paper
On computing medians of marked point process data under edit distance2024-01-25Paper
Monotone diameter of bisubmodular polyhedra2023-12-12Paper
How to perturb Bernoulli shift map2023-01-26Paper
https://portal.mardi4nfdi.de/entity/Q51044192022-09-09Paper
Minimum point-overlap labelling*2021-07-06Paper
The diameter of lattice zonotopes2020-06-11Paper
An asymptotically improved upper bound on the diameter of polyhedra2019-09-11Paper
A simple projection algorithm for linear programming problems2019-01-11Paper
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number2018-10-18Paper
A refinement of Todd's bound for the diameter of a polyhedron2018-09-28Paper
A primal-simplex based Tardos' algorithm2018-09-28Paper
https://portal.mardi4nfdi.de/entity/Q53763702018-09-17Paper
SMALL DEGENERATE SIMPLICES CAN BE BAD FOR SIMPLEX METHODS2018-03-29Paper
Minimum Point-Overlap Labeling2017-07-21Paper
Improving bounds on the diameter of a polyhedron in high dimensions2017-06-23Paper
A simple proof of tail--polynomial bounds on the diameter of polyhedra2016-04-14Paper
Maximizing Barber's bipartite modularity is also hard2015-07-22Paper
Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs2015-07-21Paper
Lagrangian relaxation and pegging test for the clique partitioning problem2015-02-23Paper
Redundant constraints in the standard formulation for the clique partitioning problem2015-02-23Paper
Fractional programming formulation for the vertex coloring problem2014-08-28Paper
Preference profiles determining the proposals in the Gale-Shapley algorithm for stable matching problems2012-12-28Paper
LAGRANGIAN RELAXATION AND PEGGING TEST FOR LINEAR ORDERING PROBLEMS(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions))2012-12-08Paper

Research outcomes over time

This page was built for person: Noriyoshi Sukegawa