Results 1  10
of
64
A class of perfect graphs containing P6
, 2003
"... Let P6 denote the induced path on six nodes. We prove that if a perfect graph G contains P6 as an induced subgraph but not two families introduced by Conforti and Cornue ´ jols then G is bipartite or disconnected, or %G has a star cutset. ..."
Abstract
 Add to MetaCart
Let P6 denote the induced path on six nodes. We prove that if a perfect graph G contains P6 as an induced subgraph but not two families introduced by Conforti and Cornue ´ jols then G is bipartite or disconnected, or %G has a star cutset.
Some Properties of Clothoids
 INRIA, NICE – SOPHIA ANTIPOLIS, RESEARCH REPORT N0 2752
, 1995
"... In the present paper we prove some geometric properties of clothoids. A clothoid (or Cornu's spiral) is a plane curve whose curvature is a linear function of its length. In suitably chosen coordinates it is given by Frenel's integrals x(t) = R t 0 cos(B 2 =2)d , y(t) = R t 0 sin(B ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In the present paper we prove some geometric properties of clothoids. A clothoid (or Cornu's spiral) is a plane curve whose curvature is a linear function of its length. In suitably chosen coordinates it is given by Frenel's integrals x(t) = R t 0 cos(B 2 =2)d , y(t) = R t 0 sin
The Beetles of the Pacific Northwest
 Heteromera. Seattle, University of Washington Press
, 1965
"... to the memory of my wife ..."
Theory and Methodo logy New inequalities for the General Routing Problem
, 1994
"... A large new class of valid inequalities i introduced for the General Routing Problem which properly contains the class of 'KC constraints'. These are also valid for the Rural Postman Problem. A separation algorithm is given for a subset of these inequalities which runs in polynomial time. ..."
Abstract
 Add to MetaCart
A large new class of valid inequalities i introduced for the General Routing Problem which properly contains the class of 'KC constraints'. These are also valid for the Rural Postman Problem. A separation algorithm is given for a subset of these inequalities which runs in polynomial time.
Choosing Algorithm Parameters Strategically
"... In this paper we examine the potential use of articial intelligence in choosing values for free parameters in the software implementation of algorithms. As a particular example we examine a branchandcut procedure for solving integer programs and an implementation of that algorithm called MIPO. We ..."
Abstract
 Add to MetaCart
In this paper we examine the potential use of articial intelligence in choosing values for free parameters in the software implementation of algorithms. As a particular example we examine a branchandcut procedure for solving integer programs and an implementation of that algorithm called MIPO. We examine a particular parameter in that procedure called the skip factor whose value decides how often cuts are added to the problem description. We demonstrate how carefully choosing the value for this parameter using neural networks results in a decrease in solution time compared to using a fixed value or a value suggested by MIPO.
POLYHEDRAL TECHNIQUES FOR GRAPHIC COVERING PROBLEMS
"... The motivation of this thesis is twofold: (i) designing approximation algorithms for NPhard covering problems in graphs by unearthing polyhedral roots to better understood problems, and (ii) a dual approach in which we hope to expand the foundation of wellunderstood polyhedra. Our design ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
The motivation of this thesis is twofold: (i) designing approximation algorithms for NPhard covering problems in graphs by unearthing polyhedral roots to better understood problems, and (ii) a dual approach in which we hope to expand the foundation of wellunderstood polyhedra. Our design
World Wide Web at:
"... The online version of this article, along with updated information and services, is located on the ..."
Abstract
 Add to MetaCart
The online version of this article, along with updated information and services, is located on the
BC v2.0  Design, usage, strategies and some test results
, 1998
"... In this paper we describe a branchandcut solver, BC, which can solve combinatorial optimization programs using branchandcut. We focus on how a mixed integer solver using branchandcut can be implemented using a base support system such as ABACUS, with an emphasis on how the system can be design ..."
Abstract
 Add to MetaCart
In this paper we describe a branchandcut solver, BC, which can solve combinatorial optimization programs using branchandcut. We focus on how a mixed integer solver using branchandcut can be implemented using a base support system such as ABACUS, with an emphasis on how the system can be designed so that adding new functionality, such as adding new heuristics and cutting planes, is an easy task. We describe the design of BC, compare it to another solver and describe some successful strategies to solve mixed integer programs.
From Totally Unimodular to Balanced O,i+ Matrices: A Family of Integer Polytopes
, 1992
"... This document has been approved for public release and sale; its d:tiibution is unlimited. do 9223178 92 8 119 103 IUIEUI1IIlI (3yj 97a' ..."
Abstract
 Add to MetaCart
This document has been approved for public release and sale; its d:tiibution is unlimited. do 9223178 92 8 119 103 IUIEUI1IIlI (3yj 97a'
Results 1  10
of
64