The following pages link to Tomomi Matsui (Q402373):
Displaying 50 items.
- (Q198771) (redirect page) (← links)
- Fractional programming formulation for the vertex coloring problem (Q402376) (← links)
- A 2.75-approximation algorithm for the unconstrained traveling tournament problem (Q475199) (← links)
- Polynomial time approximate or perfect samplers for discretized Dirichlet distribution (Q623726) (← links)
- An improved approximation algorithm for the traveling tournament problem (Q652542) (← links)
- Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables (Q703540) (← links)
- Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers (Q940932) (← links)
- A general construction method for mixed-level supersaturated design (Q959153) (← links)
- A note on generalized rank aggregation (Q989442) (← links)
- A study of the quadratic semi-assignment polytope (Q1013294) (← links)
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems (Q1026110) (← links)
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors (Q1026115) (← links)
- On the finiteness of the criss-cross method (Q1176822) (← links)
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems (Q1177915) (← links)
- A fast bipartite network flow algorithm for selective assembly (Q1273091) (← links)
- Adjacency of the best and second best valued solutions in combinatorial optimization problems (Q1314336) (← links)
- Algorithms for finding a \(K\)th best valued assignment (Q1327213) (← links)
- Optimality of mixed-level supersaturated designs (Q1611795) (← links)
- An approximation algorithm for the traveling tournament problem (Q1761909) (← links)
- A polynomial-time algorithm to find an equitable home--away assignment (Q1779696) (← links)
- The minimum spanning tree problem on a planar graph (Q1805468) (← links)
- Adjacency on combinatorial polyhedra (Q1842660) (← links)
- An algorithm for fractional assignment problems (Q1842662) (← links)
- Cheating strategies for the Gale-Shapley algorithm with complete preference lists (Q1959731) (← links)
- Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games (Q2070558) (← links)
- Monte Carlo methods for the Shapley-Shubik power index (Q2091694) (← links)
- Trading transforms of non-weighted simple games and integer weights of weighted simple games (Q2157830) (← links)
- A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption (Q2203586) (← links)
- Additive approximation algorithms for modularity maximization (Q2221809) (← links)
- A doubly nonnegative relaxation for modularity density maximization (Q2297659) (← links)
- Semidefinite programming based approaches to the break minimization problem (Q2583777) (← links)
- Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor (Q2633546) (← links)
- (Q2708237) (← links)
- (Q2722004) (← links)
- (Q2753323) (← links)
- Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings (Q2806827) (← links)
- (Q2833773) (← links)
- (Q2921755) (← links)
- A Note on a Lower Bound for the Multiplicative Odds Theorem of Optimal Stopping (Q2923443) (← links)
- Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography (Q2942644) (← links)
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q2980928) (← links)
- Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane (Q3104643) (← links)
- (Q3154676) (← links)
- LINEAR TIME APPROXIMATION ALGORITHM FOR MULTICOLORING LATTICE GRAPHS WITH DIAGONALS (Q3158891) (← links)
- Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers (Q3395041) (← links)
- Polynomial time perfect sampling algorithm for two-rowed contingency tables (Q3419592) (← links)
- Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks (Q3439525) (← links)
- Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem (Q3439531) (← links)
- Exact algorithms for the master ring problem (Q3528154) (← links)
- An Improved Approximation Algorithm for the Traveling Tournament Problem (Q3652254) (← links)
