Integer polyhedra from supermodular functions on series-parallel posets

Schrader, Rainer and Wambach, Georg (1994) Integer polyhedra from supermodular functions on series-parallel posets.
Technical Report , 13 p.

Abstract

We define a class of integer polyhedra induced by supermodular functions on series-parallel posets. We show that permutahedra and generalized polymatroids are special instances of our approach.


Actions:
Full text not available from this repository.
Export as: [error in script]
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Paper (Technical Report)
Citations: [error in script] 0 (Google Scholar) | [error in script]
Uncontrolled Keywords: [error in script]
Subjects:
  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C10 Integer programming

  • 52-XX Convex and discrete geometry > 52Bxx Polytopes and polyhedra > 52B12 Special polytopes (linear programming, centrally symmetric, etc.)

  • 90-XX Operations research, mathematical programming > 90Bxx Operations research and management science > 90B35 Scheduling theory, deterministic

  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C27 Combinatorial optimization

  • 52-XX Convex and discrete geometry > 52Bxx Polytopes and polyhedra > 52B40 Matroids (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.)

  • Uncontrolled Keywords: integer polyhedra, scheduling, series-parallel posets, supermodular functions
    Subjects: 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C10 Integer programming
    52-XX Convex and discrete geometry > 52Bxx Polytopes and polyhedra > 52B12 Special polytopes (linear programming, centrally symmetric, etc.)
    90-XX Operations research, mathematical programming > 90Bxx Operations research and management science > 90B35 Scheduling theory, deterministic
    90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C27 Combinatorial optimization
    52-XX Convex and discrete geometry > 52Bxx Polytopes and polyhedra > 52B40 Matroids (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.)
    Divisions: Institute of Computer Science
    Depositing User: Rainer Schrader
    Date Deposited: 02 Apr 2001 00:00
    Last Modified: 09 Jan 2012 10:38
    Deposit Information:
    ZAIK Number: [error in script]
    Depositing User: Rainer Schrader
    Date Deposited: 02 Apr 2001 00:00
    Last Modified: 09 Jan 2012 10:38
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/182