AAAAAA
Results:
1-18
|
Results: 18
Authors:
KOJIMA M
MEGIDDO N
MIZUNO S
Citation: M. Kojima et al., A CONJUGATE DIRECTION METHOD FOR APPROXIMATING THE ANALYTIC CENTER OFA POLYTOPE, JOURNAL OF INEQUALITIES AND APPLICATIONS, 2(2), 1998, pp. 181-194
Authors:
BELING PA
MEGIDDO N
Citation: Pa. Beling et N. Megiddo, USING FAST MATRIX MULTIPLICATION TO FIND BASIC SOLUTIONS, Theoretical computer science, 205(1-2), 1998, pp. 307-316
Authors:
MEGIDDO N
MIZUNO S
TSUCHIYA T
Citation: N. Megiddo et al., A MODIFIED LAYERED-STEP INTERIOR-POINT ALGORITHM FOR LINEAR-PROGRAMMING, Mathematical programming, 82(3), 1998, pp. 339-355
Authors:
HEGEDUS T
MEGIDDO N
Citation: T. Hegedus et N. Megiddo, ON THE GEOMETRIC SEPARABILITY OF BOOLEAN FUNCTIONS, Discrete applied mathematics, 66(3), 1996, pp. 205-218
Authors:
KOLLER D
MEGIDDO N
VONSTENGEL B
Citation: D. Koller et al., EFFICIENT COMPUTATION OF EQUILIBRIA FOR EXTENSIVE 2-PERSON GAMES, Games and economic behavior, 14(2), 1996, pp. 247-259
A DETERMINISTIC POLY(LOG LOG N)-TIME N-PROCESSOR ALGORITHM FOR LINEAR-PROGRAMMING IN FIXED DIMENSION
Authors:
AJTAI M
MEGIDDO N
Citation: M. Ajtai et N. Megiddo, A DETERMINISTIC POLY(LOG LOG N)-TIME N-PROCESSOR ALGORITHM FOR LINEAR-PROGRAMMING IN FIXED DIMENSION, SIAM journal on computing, 25(6), 1996, pp. 1171-1195
Authors:
KOLLER D
MEGIDDO N
Citation: D. Koller et N. Megiddo, FINDING MIXED STRATEGIES WITH SMALL SUPPORTS IN EXTENSIVE FORM GAMES, International journal of game theory, 25(1), 1996, pp. 73-92
Authors:
KOLLER D
MEGIDDO N
Citation: D. Koller et N. Megiddo, CONSTRUCTING SMALL SAMPLE SPACES SATISFYING GIVEN CONSTRAINTS, SIAM journal on discrete mathematics, 7(2), 1994, pp. 260-274
Authors:
COHEN E
MEGIDDO N
Citation: E. Cohen et N. Megiddo, ALGORITHMS AND COMPLEXITY ANALYSIS FOR SOME FLOW PROBLEMS, Algorithmica, 11(3), 1994, pp. 320-340
Authors:
COHEN E
MEGIDDO N
Citation: E. Cohen et N. Megiddo, IMPROVED ALGORITHMS FOR LINEAR INEQUALITIES WITH 2 VARIABLES PER INEQUALITY, SIAM journal on computing, 23(6), 1994, pp. 1313-1347
Authors:
COHEN E
MEGIDDO N
Citation: E. Cohen et N. Megiddo, NEW ALGORITHMS FOR GENERALIZED NETWORK FLOWS, Mathematical programming, 64(3), 1994, pp. 325-336
Authors:
ALON N
MEGIDDO N
Citation: N. Alon et N. Megiddo, PARALLEL LINEAR-PROGRAMMING IN FIXED DIMENSION ALMOST SURELY IN CONSTANT-TIME, Journal of the Association for Computing Machinery, 41(2), 1994, pp. 422-434
Authors:
KOJIMA M
MEGIDDO N
MIZUNO S
Citation: M. Kojima et al., A GENERAL FRAMEWORK OF CONTINUATION METHODS FOR COMPLEMENTARITY-PROBLEMS, Mathematics of operations research, 18(4), 1993, pp. 945-963
Authors:
MEGIDDO N
TAMIR A
Citation: N. Megiddo et A. Tamir, LINEAR-TIME ALGORITHMS FOR SOME SEPARABLE QUADRATIC-PROGRAMMING PROBLEMS, Operations research letters, 13(4), 1993, pp. 203-211
Authors:
HOCHBAUM DS
MEGIDDO N
NAOR J
TAMIR A
Citation: Ds. Hochbaum et al., TIGHT BOUNDS AND 2-APPROXIMATION ALGORITHMS FOR INTEGER PROGRAMS WITH2 VARIABLES PER INEQUALITY, Mathematical programming, 62(1), 1993, pp. 69-83
Authors:
KOJIMA M
MEGIDDO N
MIZUNO S
Citation: M. Kojima et al., A PRIMAL DUAL INFEASIBLE-INTERIOR-POINT ALGORITHM FOR LINEAR-PROGRAMMING, Mathematical programming, 61(3), 1993, pp. 263-280
Authors:
KOJIMA M
MEGIDDO N
MIZUNO S
Citation: M. Kojima et al., THEORETICAL CONVERGENCE OF LARGE-STEP PRIMAL DUAL INTERIOR-POINT ALGORITHMS FOR LINEAR-PROGRAMMING, Mathematical programming, 59(1), 1993, pp. 1-21
Authors:
COHEN E
MEGIDDO N
Citation: E. Cohen et N. Megiddo, STRONGLY POLYNOMIAL-TIME AND NC ALGORITHMS FOR DETECTING CYCLES IN PERIODIC GRAPHS, Journal of the Association for Computing Machinery, 40(4), 1993, pp. 791-830
Risultati:
1-18
|