The following pages link to Toshihide Ibaraki (Q171928):
Displaying 50 items.
- Augmenting a \((k-1)\)-vertex-connected multigraph to an \(\ell\)-edge-connected and \(k\)-vertex-connected multigraph (Q2492637) (← links)
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming (Q2506214) (← links)
- Complexity of identification and dualization of positive Boolean functions (Q2508337) (← links)
- Solvable classes of discrete dynamic programming (Q2563309) (← links)
- A path relinking approach with ejection chains for the generalized assignment problem (Q2570155) (← links)
- Duality in option pricing based on prices of other derivatives (Q2643789) (← links)
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements (Q2719846) (← links)
- On minimum edge ranking spanning trees (Q2729646) (← links)
- Deduction and abduction with ordered binary decision diagrams (Q2743798) (← links)
- (Q2753937) (← links)
- (Q2762526) (← links)
- (Q2766849) (← links)
- Formulation and tabu search algorithm for the resource constrained project scheduling problem. (Q2776575) (← links)
- Disjunctions of Horn theories and their cores (Q2784452) (← links)
- An ejection chain approach for the generalized assignment problem (Q2890415) (← links)
- Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks (Q3150129) (← links)
- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem (Q3150279) (← links)
- Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices (Q3200884) (← links)
- Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities (Q3202104) (← links)
- (Q3207000) (← links)
- (Q3318566) (← links)
- (Q3368659) (← links)
- Solving the irregular strip packing problem via guided local search for overlap minimization (Q3401324) (← links)
- (Q3426435) (← links)
- Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products (Q3438996) (← links)
- (Q3491589) (← links)
- (Q3531028) (← links)
- Algorithmic Aspects of Graph Connectivity (Q3543582) (← links)
- A personal perspective on problem solving by general purpose solvers (Q3566446) (← links)
- COMPUTING BOUNDS ON RISK-NEUTRAL DISTRIBUTIONS FROM THE OBSERVED PRICES OF CALL OPTIONS (Q3566767) (← links)
- (Q3632444) (← links)
- Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem (Q3659513) (← links)
- An Algorithm for the Equipollent Resource Allocation Problem (Q3678963) (← links)
- Cautious transaction schedulers with admission control (Q3685242) (← links)
- (Q3734164) (← links)
- Design of Minimum-Cost Deadlock-Free Systems (Q3763583) (← links)
- AN ITERATIVE METHOD FOR VARIATIONAL INEQUALITIES WITH APPLICATION TO TRAFFIC EQUILIBRIUM PROBLEMS (Q3778517) (← links)
- (Q3786029) (← links)
- (Q3788955) (← links)
- (Q3798199) (← links)
- An Efficient Trust Region Algorithm for Minimizing Nondifferentiable Composite Functions (Q3826015) (← links)
- INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS (Q3830788) (← links)
- PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES (Q3863414) (← links)
- (Q3863429) (← links)
- APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS (Q3863692) (← links)
- ALGORITHMS FOR A VARIANT OF THE RESOURCE ALLOCATION PROBLEM (Q3870677) (← links)
- Notes on the Problem of the Allocation of Resources to Activities in Discrete Quantities (Q3873919) (← links)
- On Minimal Test Sets for Locating Single Link Failures in Networks (Q3904541) (← links)
- An Algorithm for Finding <i>K</i> Minimum Spanning Trees (Q3906437) (← links)
- An Algorithm for the <i>K</i> Best Solutions of the Resource Allocation Problem (Q3922187) (← links)
