We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:
Mathematics

Search Results

Showing 61-69 of 69 results

  1. A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem

    Maximization of submodular functions on a ground set is a NP-hard combinatorial optimization problem. Data correcting algorithms are among the...

    Boris Goldengorin, Diptesh Ghosh in Journal of Global Optimization
    Article 01 May 2005

  2. Multi-policy iteration with a distributed voting

    We present a novel simulation-based algorithm, as an extension of the well-known policy iteration algorithm, by combining multi-policy improvement...

    Hyeong Soo Chang in Mathematical Methods of Operations Research
    Article 01 October 2004

  3. Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach

    This paper develops a polyhedral approach to the design, analysis, and computation of dynamic allocation indices for scheduling binary-action...

    José Niño-Mora in Mathematical Programming
    Article 01 December 2002

  4. Universally Maximum Flow with Piecewise-Constant Capacities

    The maximum dynamic flow problem generalizes the standard maximum flow problem by introducing time. The object is to send as much flow from source to...
    Lisa Fleischer in Integer Programming and Combinatorial Optimization
    Conference paper 1999

  5. Resource Allocation Problems

    The resource allocation problem seeks to find an optimal allocation of a fixed amount of resources to activities so as to minimize the cost incurred...
    Naoki Katoh, Toshihide Ibaraki in Handbook of Combinatorial Optimization
    Chapter 1998

  6. Main List (by authors)

    Karl Mosler, Marco Scarsini in Stochastic Orders and Applications
    Chapter 1993

  7. Generalized Gradient Methods of Nondifferentiable Optimization Employing Space Dilatation Operations

    A broad spectrum of complex problems of mathematical programming can be rather easily reduced to problems of minimization of nondifferentiable...
    N. Z. Shor in Mathematical Programming The State of the Art
    Chapter 1983

  8. Method of ellipsoids, its generalizations and applications

    After the burst of enthusiasm caused by the Khachiyan result [5], the methods of ellipsoids turned out to be the center of attention of many...

    V. I. Gershovich, N. Z. Shor in Cybernetics
    Article 01 September 1982

  9. Title Description

    M. Thoma, A. V. Balakrishnan in An Index
    Chapter 1981
Did you find what you were looking for? Share feedback.