Search

Your search keyword '"Witzgall, C."' showing total 298 results

Search Constraints

Start Over You searched for: Author "Witzgall, C." Remove constraint Author: "Witzgall, C."
298 results on '"Witzgall, C."'

Search Results

101. A problem of scheduling conference accommodation

102. Constructing timetables for sport competitions

103. The reconstruction of latin squares with applications to school timetabling and to experimental design

104. The use of recurrence relations in computing

105. A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem

106. Clutter percolation and random graphs

107. Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory

108. On the structure of all minimum cuts in a network and applications

109. Perfect triangle-free 2-matchings

110. Heuristic analysis, linear programming and branch and bound

111. Heuristic improvement methods: How should starting solutions be chosen?

112. The distance between nodes for a class of recursive trees

113. Optimization problems arising from the incorporation of split values in search trees

114. Quadratic knapsack problems

115. Weakly admissible transformations for solving algebraic assignment and transportation problems

116. Worst case analysis of greedy type algorithms for independence systems

117. A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation

118. A technique for determining blocking and anti-blocking polyhedral descriptions

119. Polynomial bounding for NP-hard problems

120. On the symmetric travelling salesman problem: A computational study

121. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study

122. On the symmetric travelling salesman problem: Solution of a 120-city problem

123. Cutting planes from conditional bounds: A new approach to set covering

124. Dual integrality in b-matching problems

125. Certain kinds of polar sets and their relation to mathematical programming

126. Fractional vertices, cuts and facets of the simple plant location problem

127. Colouring criteria for adjacency on 0–1-polyhedra

128. Balanced matrices and property (G)

129. Preliminary airplane design aided by mathematical optimization

130. Mathematical programming and the optimization of computer simulations

131. Some operations research approaches to automobile gear train design

132. Optimal sizing of large engineering systems by separable duals

133. Application of mathematical programming to metal cutting

134. Modified Lagrangians in convex programming and their generalizations

135. Optimal design of pipeline networks carrying homogeneous coal slurry

136. Optimal design methodology for a wind power system

137. Optimization in water distribution systems engineering

138. Optimization of electrical circuits

139. Extensions of the continuity of point-to-set maps: Applications to fixed point algorithms

140. Composition and union of general algorithms of optimization

141. A multivalued approach to the Farkas lemma

142. Annex 1 The continuities of the point-to-set maps, definitions and equivalences

143. Differentiable stability in non convex and non differentiable programming

144. General reference list

145. Extensions of Zangwill’s theorem

146. Background to point-to-set maps in mathematical programming

147. A comparative study of several general convergence conditions for algorithms modeled by point-to-set maps

148. Convergence analysis for two-level algorithms of mathematical programming

149. Generalized equations and their solutions, Part I: Basic theory

150. The fixed point approach to nonlinear programming

Catalog

Books, media, physical & digital resources