The following pages link to Kazuo Murota (Q180363):
Displaying 50 items.
- A stronger multiple exchange property for \(\mathrm{M}^{\natural }\)-concave functions (Q1742897) (← links)
- Continuous relaxation for discrete DC programming (Q1749451) (← links)
- Time bounds for iterative auctions: a unified approach by discrete convex analysis (Q1751147) (← links)
- Conjugacy relationship between M-convex and L-convex functions in continuous variables (Q1764239) (← links)
- \(M\)-convex functions and tree metrics (Q1764353) (← links)
- Use of primal-dual technique in the network algorithm for two-way contingency tables (Q1774297) (← links)
- A capacity scaling algorithm for M-convex submodular flow (Q1777220) (← links)
- Exact bounds for steepest descent algorithms of $L$-convex function minimization (Q1785253) (← links)
- An identity for matching and skew-symmetric determinant (Q1805187) (← links)
- Eigensets and power products of a bimatroid (Q1813669) (← links)
- Principal structure of layered mixed matrices (Q1813973) (← links)
- Some recent results in combinatorial approaches to dynamical systems (Q1823209) (← links)
- Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175) (← links)
- Group symmetry in interior-point methods for semidefinite program (Q1863859) (← links)
- Proximity theorems of discrete convex functions (Q1881049) (← links)
- Quadratic M-convex and L-convex functions (Q1883382) (← links)
- An identity for bipartite matching and symmetric determinant (Q1894478) (← links)
- Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form (Q1894574) (← links)
- Comparison of conventional and ``invariant'' schemes of fundamental solutions method for annular domains (Q1894997) (← links)
- Finding optimal minors of valuated bimatroids (Q1895110) (← links)
- A theorem on the principal structure for independent matchings (Q1897351) (← links)
- Two algorithms for valuated \(\Delta\)-matroids (Q1921193) (← links)
- On the number of matrices to generate a matrix \(\ast\)-algebra over the real field (Q1931738) (← links)
- Bifurcation mechanism underlying echelon-mode formation (Q1965154) (← links)
- Relationship of two formulations for shortest bibranchings (Q2024606) (← links)
- Decreasing minimization on M-convex sets: background and structures (Q2089794) (← links)
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases (Q2111551) (← links)
- Note on the polyhedral description of the Minkowski sum of two L-convex sets (Q2111552) (← links)
- Discrete Fenchel duality for a pair of integrally convex and separable convex functions (Q2135548) (← links)
- Fair integral submodular flows (Q2166258) (← links)
- A note on M-convex functions on jump systems (Q2217499) (← links)
- Dijkstra's algorithm and L-concave function maximization (Q2248748) (← links)
- A shift strategy for superquadratic convergence in the dqds algorithm for singular values (Q2252236) (← links)
- Integrality of subgradients and biconjugates of integrally convex functions (Q2300646) (← links)
- Note on time bounds of two-phase algorithms for \(L\)-convex function minimization (Q2400167) (← links)
- Scaling, proximity, and optimization of integrally convex functions (Q2414902) (← links)
- Simultaneous singular value decomposition (Q2431173) (← links)
- Discrete fixed point theorem reconsidered (Q2581298) (← links)
- Substitutes and complements in network flows viewed as discrete convexity (Q2581320) (← links)
- Critical initial imperfection of structures (Q2641141) (← links)
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework (Q2706347) (← links)
- Solving sparse semidefinite programs by matrix completion. I (Q2742678) (← links)
- Solving sparse semidefinite programs by matrix completion. II (Q2742680) (← links)
- \(M\)-convex function on generalized polymatroid (Q2757584) (← links)
- On polyhedral approximation of L-convex and M-convex functions (Q2793587) (← links)
- An algorithm for the generalized eigenvalue problem for nonsquare matrix pencils by minimal perturbation approach (Q2797108) (← links)
- Bifurcation Theory for Hexagonal Agglomeration in Economic Geography (Q2841753) (← links)
- Error-controlling algorithm for simultaneous block-diagonalization and its application to independent component analysis (Q2843161) (← links)
- On discrete Hessian matrix and convex extensibility (Q2869508) (← links)
