The following pages link to Toshihide Ibaraki (Q171928):
Displaying 46 items.
- (Q4938657) (← links)
- A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs (Q4938664) (← links)
- (Q4938784) (← links)
- A variable depth search algorithm with branching search for the generalized assignment problem (Q4946717) (← links)
- (Q4949151) (← links)
- Algorithmic Aspects of the Core of Combinatorial Optimization Games (Q4951047) (← links)
- Boolean analysis of incomplete examples (Q5054834) (← links)
- A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem (Q5101432) (← links)
- Optimal coteries for rings and related networks (Q5136994) (← links)
- Technical Note—The Use of Cuts in Complementary Programming (Q5183263) (← links)
- A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem (Q5429295) (← links)
- A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route (Q5429299) (← links)
- (Q5461603) (← links)
- Lowering eccentricity of a tree by node upgrading (Q5463675) (← links)
- (Q5501844) (← links)
- (Q5501852) (← links)
- A Lower Bound of the Number of Threshold Functions (Q5507975) (← links)
- Realization of Arbitrary Logic Functions by Completely Monotonic Functions and Its Applications to Threshold Logic (Q5542549) (← links)
- On Autonomous Logic Nets of Threshold Elements (Q5549076) (← links)
- A Theory of Completely Monotonic Functions and its Applications to Threshold Logic (Q5560295) (← links)
- Adaptive Linear Classifier by Linear Programming (Q5592001) (← links)
- (Q5595900) (← links)
- Synthesis of Networks with a Minimum Number of Negative Gates (Q5613538) (← links)
- Technical Note—Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks (Q5624986) (← links)
- Gate-Interconnection Minimization of Switching Networks Using Negative Gates (Q5632454) (← links)
- Technical Note—Complementary Programming (Q5636704) (← links)
- (Q5639305) (← links)
- Design of Optimal Switching Networks by Integer Programming (Q5643891) (← links)
- (Q5650210) (← links)
- N-Fail-Safe Sequential Machines (Q5658024) (← links)
- Representation theorems for equivalent optimization problems (Q5661320) (← links)
- (Q5661329) (← links)
- Fail-safe realization of sequential machines (Q5665115) (← links)
- Algorithms for Obtaining Shortest Paths Visiting Specified Nodes (Q5667963) (← links)
- An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem (Q5888195) (← links)
- Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5893964) (← links)
- Fractional programming (Q5896201) (← links)
- Threshold Numbers and Threshold Completions (Q5904488) (← links)
- Threshold Numbers and Threshold Completions (Q5905060) (← links)
- Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5919996) (← links)
- On the difference of Horn theories (Q5929916) (← links)
- Augmenting a submodular and posi-modular set function by a multigraph (Q5943820) (← links)
- Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts (Q5952050) (← links)
- Decision lists and related Boolean functions (Q5958318) (← links)
- Two arc disjoint paths in Eulerian digraphs (Q6487950) (← links)
- A fast and simple algorithm for identifying 2-monotonic positive Boolean functions (Q6487975) (← links)
