| Publication | Date of Publication | Type |
|---|
Preemptive scheduling of parallel jobs of two sizes with controllable processing times
Journal of Scheduling | 2024-05-30 | Paper |
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
Networks | 2024-03-15 | Paper |
Characterization and algorithm for bivariate multi-unit assignment valuations
Japan Journal of Industrial and Applied Mathematics | 2024-01-18 | Paper |
Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines
Lecture Notes in Computer Science | 2023-08-03 | Paper |
| Note on Steepest Descent Algorithm for Quasi L$^{\natural}$-convex Function Minimization | 2023-07-21 | Paper |
| Note on Minimization of Quasi M$^\natural$-convex Functions | 2023-05-28 | Paper |
M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System
Mathematics of Operations Research | 2022-06-27 | Paper |
| Time bounds of basic steepest descent algorithms for \(M\)-convex function minimization and related problems | 2021-08-31 | Paper |
Machine speed scaling by adapting methods for convex optimization with submodular constraints
INFORMS Journal on Computing | 2020-11-09 | Paper |
A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption
Information Processing Letters | 2020-10-07 | Paper |
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
Journal of Global Optimization | 2020-04-21 | Paper |
| Separable convex resource allocation problem with \(L_1\)-distance constraint | 2020-01-15 | Paper |
Models and algorithms for energy-efficient scheduling with immediate start of jobs
Journal of Scheduling | 2019-08-08 | Paper |
Exact bounds for steepest descent algorithms of $L$-convex function minimization
Operations Research Letters | 2018-09-28 | Paper |
On equivalence of \(M^\natural\)-concavity of a set function and submodularity of its conjugate
(available as arXiv preprint) | 2018-09-17 | Paper |
| M-convex Function Minimization Under L1-Distance Constraint | 2018-09-10 | Paper |
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
European Journal of Operational Research | 2018-05-30 | Paper |
Time bounds for iterative auctions: a unified approach by discrete convex analysis
Discrete Optimization | 2018-05-24 | Paper |
Buyback problem with discrete concave valuation functions
Discrete Optimization | 2018-05-24 | Paper |
Simpler exchange axioms for M-concave functions on generalized polymatroids
Japan Journal of Industrial and Applied Mathematics | 2018-04-12 | Paper |
Colored spanning graphs for set visualization
Computational Geometry | 2018-02-19 | Paper |
Colored spanning graphs for set visualization
Computational Geometry | 2018-02-19 | Paper |
Handling scheduling problems with controllable parameters by methods of submodular optimization
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS
Journal of the Operations Research Society of Japan | 2017-12-11 | Paper |
Note on time bounds of two-phase algorithms for \(L\)-convex function minimization
Japan Journal of Industrial and Applied Mathematics | 2017-08-28 | Paper |
A unified view to greedy geometric routing algorithms in ad hoc networks
Algorithms for Sensor Systems | 2016-12-19 | Paper |
Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
INFORMS Journal on Computing | 2016-05-19 | Paper |
Equilibrium, auction, and generalized gross substitutes and complements
Journal of the Operations Research Society of Japan | 2016-04-13 | Paper |
Buyback problem with discrete concave valuation functions
Approximation and Online Algorithms | 2016-02-26 | Paper |
Monotonicity in steepest ascent algorithms for polyhedral \(L\)-concave functions
Journal of the Operations Research Society of Japan | 2015-12-11 | Paper |
Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
Mathematical Programming. Series A. Series B | 2015-10-19 | Paper |
Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functions
Japan Journal of Industrial and Applied Mathematics | 2015-09-15 | Paper |
GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
Journal of the Operations Research Society of Japan | 2015-08-05 | Paper |
Polynomial-time approximation schemes for maximizing gross substitutes utility under budget constraints
Mathematics of Operations Research | 2015-04-01 | Paper |
Dijkstra's algorithm and L-concave function maximization
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items
Algorithms and Computation | 2014-01-14 | Paper |
Optimal allocation problem with quadratic utility functions and its relationship with graph cut problem
Journal of the Operations Research Society of Japan | 2014-01-03 | Paper |
A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Matroid rank functions and discrete concavity
Japan Journal of Industrial and Applied Mathematics | 2012-12-28 | Paper |
Neighbor systems, jump systems, and bisubmodular polyhedra
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
M-convex function minimization by continuous relaxation approach: proximity theorem and algorithm
SIAM Journal on Optimization | 2012-01-09 | Paper |
Polynomial-time approximation schemes for maximizing gross substitutes utility under budget constraints
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Optimal allocation in combinatorial auctions with quadratic utility functions
Lecture Notes in Computer Science | 2011-07-01 | Paper |
A fast algorithm for computing a nearly equitable edge coloring with balanced conditions
Journal of Graph Algorithms and Applications | 2011-02-16 | Paper |
Neighbor systems, jump systems, and bisubmodular polyhedra
Algorithms and Computation | 2010-12-09 | Paper |
Efficiently pricing European-Asian options-ultimate implementation and analysis of the AMO algorithm
Information Processing Letters | 2010-01-29 | Paper |
New algorithms for convex cost tension problem with application to computer vision
Discrete Optimization | 2009-11-23 | Paper |
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
Lecture Notes in Computer Science | 2009-07-23 | Paper |
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
International Journal of Foundations of Computer Science | 2009-06-23 | Paper |
ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
Discrete Mathematics, Algorithms and Applications | 2009-06-23 | Paper |
NOTE ON THE CONTINUITY OF M-CONVEX AND L-CONVEX FUNCTIONS IN CONTINUOUS VARIABLES
Journal of the Operations Research Society of Japan | 2009-05-22 | Paper |
Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems
SIAM Journal on Discrete Mathematics | 2008-05-22 | Paper |
EFFICIENT STRATEGY PROOF FAIR ALLOCATION ALGORITHMS
Journal of the Operations Research Society of Japan | 2006-10-04 | Paper |
Substitutes and complements in network flows viewed as discrete convexity
Discrete Optimization | 2006-01-09 | Paper |
Algorithmic Applications in Management
Lecture Notes in Computer Science | 2005-11-30 | Paper |
On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem
Mathematics of Operations Research | 2005-11-11 | Paper |
A fast, accurate, and simple method for pricing European-Asian and saving-Asian options
Algorithmica | 2005-08-02 | Paper |
| scientific article; zbMATH DE number 2190127 (Why is no real title available?) | 2005-08-01 | Paper |
Conjugacy relationship between M-convex and L-convex functions in continuous variables
Mathematical Programming. Series A. Series B | 2005-02-24 | Paper |
Quadratic M-convex and L-convex functions
Advances in Applied Mathematics | 2004-10-12 | Paper |
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
Operations Research Letters | 2004-07-01 | Paper |
Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
Discrete Applied Mathematics | 2004-01-26 | Paper |
Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization
Discrete Applied Mathematics | 2003-10-14 | Paper |
| scientific article; zbMATH DE number 1947439 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1789203 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1741099 (Why is no real title available?) | 2002-05-15 | Paper |
\(M\)-convex function on generalized polymatroid
Mathematics of Operations Research | 2001-11-26 | Paper |
| scientific article; zbMATH DE number 1322432 (Why is no real title available?) | 2001-11-06 | Paper |
| scientific article; zbMATH DE number 1568136 (Why is no real title available?) | 2001-02-21 | Paper |
| scientific article; zbMATH DE number 1445399 (Why is no real title available?) | 2001-02-08 | Paper |
Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
Discrete Applied Mathematics | 2001-01-01 | Paper |
Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks
Operations Research Letters | 2001-01-01 | Paper |
Extension of M-convexity and L-convexity to polyhedral convex functions
Advances in Applied Mathematics | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1377657 (Why is no real title available?) | 1999-12-14 | Paper |
A constructive proof for the induction of M-convex functions through networks
Discrete Applied Mathematics | 1998-11-26 | Paper |
Minimization of an M-convex function
Discrete Applied Mathematics | 1998-10-18 | Paper |
| scientific article; zbMATH DE number 1091558 (Why is no real title available?) | 1997-11-25 | Paper |
A Linear Time Algorithm for Finding ak-Tree Core
Journal of Algorithms | 1997-06-04 | Paper |
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
SIAM Journal on Computing | 1997-05-26 | Paper |
EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
Journal of the Operations Research Society of Japan | 1997-05-25 | Paper |
