Jumping Doesn’t Help in Abstract Cubes

We construct a class of abstract objective functions on the cube, such that the algorithm BottomAntipodal takes exponentially many steps to find the maximum. A similar class of abstract objective functions is constructed for the process BottomTop, also requiring exponentially many steps.

Saved in:
Bibliographic Details
Published inInteger Programming and Combinatorial Optimization pp. 225 - 235
Main Authors Schurr, Ingo, Szabó, Tibor
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
Springer
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
Current Vertex
Exact sciences and technology
Flows in networks. Combinatorial problems
Linear Objective Function
Operational research and scientific management
Operational research. Management science
Outgoing Edge
Simple Polytope
Simplex Algorithm
Integer programming
Objective function
Combinatorial optimization
Jumping
Cube
Online AccessGet full text

Cover

More Information
Summary:We construct a class of abstract objective functions on the cube, such that the algorithm BottomAntipodal takes exponentially many steps to find the maximum. A similar class of abstract objective functions is constructed for the process BottomTop, also requiring exponentially many steps.
ISBN:9783540261995
3540261990
ISSN:0302-9743
1611-3349
DOI:10.1007/11496915_17