Results 91 to 100 of about 145 (122)

Polyhedral Combinatorics of Benzenoid Problems

Lecture Notes in Computer Science, 1998
Many chemical properties of benzenoid hydrocarbons can be understood in terms of the maximum number of mutually resonant hexagons, or Clar number, of the molecules. Hansen and Zheng (1994) formulated this problem as an integer program and conjectured, based on computational evidence, that solving the linear programming relaxation always yields integral
Gary Atkinson
exaly   +2 more sources

Polyhedral Combinatorics in Combinatorial Optimization

Statistica Neerlandica, 1987
Polyhedral combinatorics is a subarea of combinatorial optimization of increasing practical importance. It deals with the application of the theory of linear systems and linear algebra to combinatorial problems. The paper is not intended as a survey on polyhedral combinatorics but it reviews some of the main concepts and proof techniques.
Gerards, A.M.H., Kolen, A.W.J.
exaly   +2 more sources

Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem

Journal of Combinatorial Optimization, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vicky Mak, Tommy Thomadsen
exaly   +3 more sources

Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations

Lecture Notes in Computer Science, 1998
For the classical quadratic assignment problem (QAP) that requires n objects to be assigned to n locations (the n × n-case), polyhe- dral studies have been started in the very recent years by several authors. In this paper, we investigate the variant of the QAP, where the number of locations may exceed the number of objects (the m × n-case).
exaly   +2 more sources

Polyhedral Combinatorics

1983
Pulleyblank W R, W R Pulleyblank
exaly   +2 more sources

Chapter V Polyhedral combinatorics

Handbooks in Operations Research and Management Science, 1989
W R Pulleyblank
exaly   +2 more sources

D.R. Fulkerson’s contributions to polyhedral combinatorics

Mathematical Programming Studies, 1978
Hoffman A J
exaly   +2 more sources

Polyhedral Combinatorics

2005
Konjevod Göran
exaly   +2 more sources

Polyhedral combinatorics and the acyclic subdigraph problem

Mathematical Social Sciences, 1986
F W Roush
exaly   +2 more sources

Polyhedral Combinatorics and Neural Networks

Neural Computation, 1994
The often disappointing performance of optimizing neural networks can be partly attributed to the rather ad hoc manner in which problems are mapped onto them for solution. In this paper a rigorous mapping is described for quadratic 0-1 programming problems with linear equality and inequality constraints, this being the most general class of problem ...
Andrew H. Gee, Richard W. Prager
openaire   +1 more source