论文列表及评分结果

Resolving degeneracy in combinatorial linear programs: steepest edge, steepest ascent, and parametric ascent.

电商所评分:2

点击查看评分详情!

Minimal representation of quadratically constrained convex feasible regions.

电商所评分:3

点击查看评分详情!

On co-positive, semi-monotone Q-matrices.

电商所评分:8

点击查看评分详情!

A characterization of weakly efficient points.

电商所评分:9

点击查看评分详情!

Computational experience with a difficult mixed-integer multicommodity flow problem.

电商所评分:3

点击查看评分详情!

The precedence-constrained asymmetric traveling salesman polytope.

电商所评分:8

点击查看评分详情!

A trust-region strategy for minimization on arbitrary domains.

电商所评分:8

点击查看评分详情!

On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms.

电商所评分:7

点击查看评分详情!

A unified approach to global convergence of trust region methods for nonsmooth optimization.

电商所评分:2

点击查看评分详情!

Minimizing symmetric submodular functions.

电商所评分:7

点击查看评分详情!

An efficient approximation algorithm for the survivable network design problem.

电商所评分:9

点击查看评分详情!

Random sampling and greedy sparsification for matroid optimization problems.

电商所评分:5

点击查看评分详情!

Packing algorithms for arborescences (and spanning trees) in capacitated graphs.

电商所评分:7

点击查看评分详情!

An improved approximation ratio for the minimum latency problem.

电商所评分:9

点击查看评分详情!

The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases.

电商所评分:4

点击查看评分详情!

Base polytopes of series-parallel posets: Linear description and optimization.

电商所评分:1

点击查看评分详情!

Approximability of flow shop scheduling.

电商所评分:3

点击查看评分详情!

Makespan minimization in open shops: A polynomial time approximation scheme.

电商所评分:10

点击查看评分详情!

Minimizing average completion time in the presence of release dates.

电商所评分:10

点击查看评分详情!

Scheduling uniform machines on-line requires nondecreasing speed ratios.

电商所评分:2

点击查看评分详情!

Sequencing jobs that require common resources on a single machine: A solvable case of the TSP.

电商所评分:7

点击查看评分详情!

Approximation algorithms for two-machine flow shop scheduling with batch setup times.

电商所评分:1

点击查看评分详情!

Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine.

电商所评分:3

点击查看评分详情!

Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function.

电商所评分:9

点击查看评分详情!

A polyhedron with alls - t cuts as vertices, and adjacency of cuts.

电商所评分:8

点击查看评分详情!

Segments in enumerating faces.

电商所评分:10

点击查看评分详情!

On bilevel programming, Part I: General nonlinear cases.

电商所评分:6

点击查看评分详情!

On structure and stability in stochastic programs with random technology matrix and complete integer recourse.

电商所评分:9

点击查看评分详情!

Implicit function theorems for generalized equations.

电商所评分:9

点击查看评分详情!

The curvature integral and the complexity of linear complementarity problems.

电商所评分:8

点击查看评分详情!