The following pages link to Satoru Fujishige (Q308602):
Displaying 50 items.
- Random decentralized market processes for stable job matchings with competitive salaries (Q308603) (← links)
- The root location problem for arc-disjoint arborescences (Q442209) (← links)
- A note on disjoint arborescences (Q532132) (← links)
- Canonical decompositions of symmetric submodular systems (Q760444) (← links)
- A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors (Q761525) (← links)
- A note on Frank's generalized polymatroids (Q790124) (← links)
- Zonotopes and the LP-Newton method (Q833464) (← links)
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks (Q860399) (← links)
- Matroids on convex geometries (cg-matroids) (Q882114) (← links)
- Minimizing a monotone concave function with laminar covering constraints (Q943837) (← links)
- A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph (Q990080) (← links)
- A general model for matroids and the greedy algorithm (Q1013980) (← links)
- A decomposition of distributive lattices (Q1057293) (← links)
- On the equivalence of the maximum balanced flow problem and the weighted minimax flow problem (Q1083364) (← links)
- An out-of-kilter method for submodular flows (Q1095780) (← links)
- Finding a homotopy base for directed paths in an acyclic graph (Q1099184) (← links)
- Optimization over the polyhedron determined by a submodular function on a co-intersecting family (Q1116890) (← links)
- Principal structures of submodular systems (Q1139052) (← links)
- An efficient PQ-graph algorithm for solving the graph-realization problem (Q1142044) (← links)
- A note on the Frank-Tardos bi-truncation algorithm for crossing- submodular functions (Q1184356) (← links)
- Submodular functions and optimization (Q1188800) (← links)
- New algorithms for the intersection problem of submodular systems (Q1202762) (← links)
- Minimizing a submodular function arising from a concave function (Q1304480) (← links)
- A lexicographic algebraic theorem and its applications (Q1307556) (← links)
- A new saling algorithm for the maximum mean cut problem (Q1317477) (← links)
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane (Q1335567) (← links)
- Notes on L-/M-convex functions and the separation theorems (Q1591359) (← links)
- A note on Faigle and Kern's dual greedy polyhedra (Q1591366) (← links)
- A descent method for submodular function minimization (Q1611012) (← links)
- Polynomial combinatorial algorithms for skew-bisubmodular function minimization (Q1785196) (← links)
- Congestion games viewed from M-convexity (Q1785371) (← links)
- A maximum flow algorithm using MA ordering. (Q1811623) (← links)
- On structures of bisubmodular polyhedra (Q1814796) (← links)
- Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2 (Q1827668) (← links)
- Realization of set functions as cut functions of graphs and hypergraphs (Q1841904) (← links)
- A simple matching algorithm for regular bipartite graphs. (Q1853135) (← links)
- A characterization of bisubmodular functions (Q1910557) (← links)
- Decomposition of a bidirected graph into strongly connected components and its signed poset structure (Q1923614) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Lattice polyhedra and submodular flows (Q1926644) (← links)
- Independent arborescences in directed graphs (Q1937557) (← links)
- On the feasible payoff set of two-player repeated games with unequal discounting (Q1939510) (← links)
- A note on polylinking flow networks (Q1942270) (← links)
- A laminarity property of the polyhedron described by a weakly posi-modular set function (Q1962025) (← links)
- A note on submodular function minimization by Chubanov's LP algorithm (Q2010920) (← links)
- Discrete 2-convex functions (Q2089790) (← links)
- Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
- Compression of \(\mathrm{M}^\natural\)-convex functions -- flag matroids and valuated permutohedra (Q2237937) (← links)
- Remarks on ''Optimal stochastic control for discrete-time linear system with interrupted observations''. With reply by Shohei Fujita and Takeshi Fukao (Q2264644) (← links)
