#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1995

2017

- This year (4)
- Last 5 years (9)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Gerald Gamrath, Tobias Fischer, +18 authors Jakob Witzig
- 2016

The SCIP Optimization Suite is a software toolbox for generating and solving various classes of mathematical optimization problems. Its major components are the modeling language ZIMPL, the linear programming solver SoPlex, the constraint integer programming framework and mixed-integer linear and nonlinear programming solver SCIP, the UG framework for… (More)

- Shogo Asai, Yuusuke Kounoike, Yuji Shinano, Keiichi Kaneko
- Euro-Par
- 2006

An n-pancake graph is a graph whose vertices are the permutations of n symbols and each pair of vertices are connected with an edge if and only if the corresponding permutations can be transitive by a prefix reversal. Since the n-pancake graph has n! vertices, it is known to be a hard problem to compute its diameter by using an algorithm with the polynomial… (More)

- Thorsten Koch, Ted K. Ralphs, Yuji Shinano
- Math. Meth. of OR
- 2012

Given the steady increase in cores per CPU, it is only a matter of time before supercomputers will have a million or more cores. In this article, we investigate the opportunities and challenges that will arise when trying to utilize this vast computing power to solve a single integer linear optimization problem. We also raise the question of whether best… (More)

- Gerald Gamrath, Thorsten Koch, Stephen J. Maher, Daniel Rehfeldt, Yuji Shinano
- Math. Program. Comput.
- 2017

In this article we describe the impact from embedding a 15 year old model for solving the Steiner tree problem in graphs in a stateof-the-art MIP-Framework, making the result run in a massively parallel environment and extending the model to solve as many problem variants as possible. We end up with a high-performance solver that is capable of solving… (More)

- Yuusuke Kounoike, Keiichi Kaneko, Yuji Shinano
- 8th International Symposium on Parallel…
- 2005

Computing the diameter of a pancake graph is equivalent to solving the "pancake sorting problem" (or "prefix reversal problem"), which is basically the problem of finding the maximum number of pancake flips one would need to perform in order to sort an arbitrary stack of pancakes. The diameter of a pancake graph can be computed by solving the shortest path… (More)

- Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch, Michael Winkler
- 2014 IEEE International Parallel & Distributed…
- 2014

Contemporary supercomputers can easily provide years of CPU time per wall-clock hour. One challenge of today's software development is how to harness this vast computing power in order to solve really hard mixed-integer programming instances. In 2010, two out of six open MIPLIB2003 instances could be solved by ParaSCIP in more than ten consecutive runs,… (More)

- Yuji Shinano, Masahiro Higaki, Ryuichi Hirabayashi
- SPDP
- 1995

Branch and bound algorithms are general methods applied to various combinatorial optimization problems. Recently, parallelizations of these algorithms have been proposed. In spite of the generality of these methods, many of the parallelizations have been set up for a speciic problem and a speciic parallel computer. In this paper, a generalized utility PUBB… (More)

- Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
- IPPS
- 1997

Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these algorithms. Parallel branch-and-bound algorithm implementations can be divided in two types based on whether a central or a distributed control scheme is used. Central control… (More)

- Yuji Shinano, Tetsuya Fujie, Yoshiko Ikebe, Ryuichi Hirabayashi
- IPPS/SPDP
- 1998

Given an (undirected) graph G = (V;E); a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a classical NP–hard problem, and many algorithms, both heuristic and exact, have been proposed. While the philosophy behind the heuristic algorithms varies greatly, almost all of the… (More)

- Yuji Shinano, Tetsuya Fujie
- PVM/MPI
- 2007