• DocumentCode
    2892457
  • Title

    Dynamic three-dimensional linear programming

  • Author

    Eppstein, David

  • Author_Institution
    Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA
  • fYear
    1991
  • fDate
    1-4 Oct 1991
  • Firstpage
    488
  • Lastpage
    494
  • Abstract
    Linear programming optimizations on the intersection of k polyhedra in R3, represented by their outer recursive decompositions, are performed in expected time O(k log k log n+√k log k log3 n). This result is used to derive efficient algorithms for dynamic linear programming problems ill which constraints are inserted and deleted, and queries must optimize specified objective functions. As an application, an improved solution to the planar 2-center problem, is described
  • Keywords
    computational complexity; linear programming; dynamic 3D linear programming; dynamic three dimensional programming; expected time; objective functions; outer recursive decompositions; planar 2-center problem; Application software; Computer science; Constraint optimization; Data structures; Dynamic programming; Heuristic algorithms; Linear programming; Time factors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
  • Conference_Location
    San Juan
  • Print_ISBN
    0-8186-2445-0
  • Type

    conf

  • DOI
    10.1109/SFCS.1991.185410
  • Filename
    185410
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2892457