The following pages link to Toshihide Ibaraki (Q171928):
Displayed 50 items.
- A note on minimizing submodular functions (Q293366) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships (Q556008) (← links)
- Logical analysis of data: classification with justification (Q646700) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- Multicommodity flows in certain planar directed networks (Q753654) (← links)
- Chain packing in graphs (Q808291) (← links)
- The vehicle routing problem with flexible time windows and traveling times (Q860386) (← links)
- Minimum edge ranking spanning trees of split graphs (Q860397) (← links)
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions (Q943841) (← links)
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
- Translation among CNFs, characteristic models and ordered binary decision diagrams (Q1007523) (← links)
- A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem (Q1007574) (← links)
- Scheduling of corrugated paper production (Q1011222) (← links)
- (Q1051430) (redirect page) (← links)
- On-line computation of transitive closures of graphs (Q1051432) (← links)
- An efficient algorithm for the parametric resource allocation problem (Q1058467) (← links)
- A generalization of alpha-beta and \(SSS^*\) search procedures (Q1076524) (← links)
- Distances defined by neighborhood sequences (Q1082093) (← links)
- A cautious scheduler for multistep transactions (Q1101210) (← links)
- A comparative study of several semi-infinite nonlinear programming algorithms (Q1102202) (← links)
- Strong unimodularity for matrices and hypergraphs (Q1104339) (← links)
- The number of additional variables required for the integer programming formulation (Q1139503) (← links)
- An algorithm for the fair resource allocation problem with a submodular constraint (Q1179783) (← links)
- Successive linearization methods for large-scale nonlinear programming problems (Q1185122) (← links)
- Optimal strategies for some team games (Q1186315) (← links)
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph (Q1186788) (← links)
- A linear time algorithm for computing 3-edge-connected components in a multigraph (Q1199755) (← links)
- On the average optimality of circular assignment policy (Q1201826) (← links)
- Primal-dual proximal point algorithm for linearly constrained convex programming problems (Q1203067) (← links)
- An optimal backup policy for a hard computer disk depending on age under availability criterion (Q1206101) (← links)
- Optimal minimal-repair and replacement problem with age dependent cost structure (Q1206111) (← links)
- A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control (Q1208453) (← links)
- On the optimality of algorithms for finite state sequential decision processes (Q1228439) (← links)
- Integer programming formulation of combinatorial optimization problems (Q1239086) (← links)
- On max-flow min-cut and integral flow properties for multicommodity flows in directed networks (Q1262198) (← links)
- A globally convergent SQP method for semi-infinite nonlinear optimization (Q1262218) (← links)
- On generalized pseudoconvex functions (Q1262221) (← links)
- The use of dynamic programming in genetic algorithms for permutation problems (Q1268271) (← links)
- Double Horn functions (Q1271644) (← links)
- Double-offer arbitration (Q1278557) (← links)
- A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons (Q1280281) (← links)
- Functional dependencies in Horn theories (Q1285668) (← links)
- Analyses on the 2 and 3-flip neighborhoods for the MAX SAT (Q1304388) (← links)
- A dynamic programming method for single machine scheduling (Q1331548) (← links)
- Searching minimax game trees under memory space constraint (Q1356215) (← links)
- Positive and Horn decomposability of partially defined Boolean functions (Q1356507) (← links)
- Hitting or avoiding balls in Euclidean space (Q1357768) (← links)
- Vehicle scheduling on a tree with release and handling times (Q1357781) (← links)
- Logical analysis of numerical data (Q1365054) (← links)