Software
- ODICON : Optimization algorithms for DIscrete CONvex functions
- Approximating Submodular Functions
- CCFlib, VIAP, SNF : Algorithms on layered mixed matrices, and mixed polynomial matrices
- Graph Realization Programs
- M
-Convex Function Partition Program
Demonstration
- Quadratic L-convex function minimization
- Quadratic M-convex function minimization
- Pseudo-separable L-convex function minimization
- Laminar M-convex function minimization
- Inventory Problem: L-convex function minimization
- Shift Scheduling Problem: L-convex function minimization
- Shannon Switching Game
References
Members
- Kazuo MUROTA (The Institute of Statistical Mathematics)
- Satoru IWATA (University of Tokyo)
- Akiyoshi SHIOURA (Tokyo Institute of Technology)
- Satoko MORIGUCHI (Tokyo Metropolitan University)
- Nobuyuki TSUCHIMURA (Kwansei Gakuin University)
- Naonori KAKIMURA (Keio University)
- Hiroshi HIRAI (University of Tokyo)
- Takanori MAEHARA (Meta, Inc.)