30 results on '"Matsui, Tomomi"'
Search Results
2. New Formulation for Coloring Circle Graphs And its Application to Capacitated Stowage Stack Minimization
3. Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games
4. Additive approximation algorithms for modularity maximization
5. A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption
6. A doubly nonnegative relaxation for modularity density maximization
7. Uptake mechanisms of polychlorinated biphenyls in Cucurbita pepo via xylem sap containing major latex-like proteins
8. Random generation of 2×2×⋯×2×J contingency tables
9. Ergothioneine protects Streptomyces coelicolor A3(2) from oxidative stresses
10. Zinc finger protein genes from Cucurbita pepo are promising tools for conferring non-Cucurbitaceae plants with ability to accumulate persistent organic pollutants
11. Fractional programming formulation for the vertex coloring problem
12. Antifungal efficacy of Brazilian green propolis extracts and honey on Tinea capitis and Tinea versicolor
13. A note on generalized rank aggregation
14. An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
15. Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
16. A study of the quadratic semi-assignment polytope
17. Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem
18. Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks
19. Semidefinite programming based approaches to the break minimization problem
20. A general construction method for mixed-level supersaturated design
21. A polynomial-time algorithm to find an equitable home–away assignment
22. Optimality of mixed-level supersaturated designs
23. NP-completeness for calculating power indices of weighted majority games
24. Asymmetric [2,3] Wittig rearrangement of crotyl furfuryl ethers
25. A fast bipartite network flow algorithm for selective assembly
26. The minimum spanning tree problem on a planar graph
27. An algorithm for fractional assignment problems
28. Algorithms for finding a Kth best valued assignment
29. Adjacency of the best and second best valued solutions in combinatorial optimization problems
30. On the finiteness of the criss-cross method
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.