Results 1  10
of
35
Complete search in continuous global optimization and constraint satisfaction, Acta Numerica 13
, 2004
"... A chapter for ..."
Lock Allocation
 POPL'07
, 2007
"... We introduce lock allocation, an automatic technique that takes a multithreaded program annotated with atomic sections (that must be executed atomically), and infers a lock assignment from global variables to locks and a lock instrumentation that determines where each lock should be acquired and re ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
We introduce lock allocation, an automatic technique that takes a multithreaded program annotated with atomic sections (that must be executed atomically), and infers a lock assignment from global variables to locks and a lock instrumentation that determines where each lock should be acquired and released such that the resulting instrumented program is guaranteed to preserve atomicity and deadlock freedom (provided all shared state is accessed only within atomic sections). Our algorithm works in the presence of pointers and procedures, and sets up the lock allocation problem as a 01 ILP which minimizes the conflict cost between atomic sections while simultaneously minimizing the number of locks. We have implemented our algorithm for both C with pthreads and Java, and have applied it to infer locks in 15K lines of AOLserver code. Our automatic allocation produces the same results as hand annotations for most of this code, while solving the optimization instances within a second for most programs.
Noncommercial Software for MixedInteger Linear Programming
, 2004
"... We present an overview of noncommercial software tools for the solution of mixedinteger linear programs (MILPs). We first review solution methodologies for MILPs and then present an overview of the available software, including detailed descriptions of eight software packages available under open s ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
We present an overview of noncommercial software tools for the solution of mixedinteger linear programs (MILPs). We first review solution methodologies for MILPs and then present an overview of the available software, including detailed descriptions of eight software packages available under open source or other noncommercial licenses. Each package is categorized as a black box solver, a callable library, a solver framework, or some combination of these. The distinguishing features of all eight packages are described. The paper concludes with case studies that illustrate the use of two of the solver frameworks to develop custom solvers for specific problem classes and with benchmarking of the six black box solvers.
Mixed Global Constraints and Inference in Hybrid CLPIP Solvers
, 2001
"... The complementing strengths of Constraint (Logic) Programming (CLP) and Mixed Integer Programming (IP) have recently received signicant attention. Although various optimization and constraint programming packages at a rst glance seem to support mixed models, the modeling and solution techniques ..."
Abstract

Cited by 16 (8 self)
 Add to MetaCart
The complementing strengths of Constraint (Logic) Programming (CLP) and Mixed Integer Programming (IP) have recently received signicant attention. Although various optimization and constraint programming packages at a rst glance seem to support mixed models, the modeling and solution techniques encapsulated are still rudimentary. Apart from exchanging bounds for variables and objective, little is known of what constitutes a good hybrid model and how a hybrid solver can utilize the complementary strengths of inference and relaxations. This paper adds to the eld by identifying constraints as the essential link between CLP and IP and introduces an algorithm for bidirectional inference through these constraints. Together with new search strategies for hybrid solvers and cutgenerating mixed global constraints, solution speed is improved over both traditional IP codes and newer mixed solvers. Keywords: Mixed Integer Programming, Constraint Logic Programming, Integration, Mixed Global Contraints, Dynamic Linear Relaxations, Inference. AMS Subject classication: 68N99,68Q99,68T99,90C05,90C11,90C27. 1.
Algorithms for Maximum Independent Set Applied to Map Labelling
, 2000
"... We consider the following map labelling problem: given distinct points p 1 , p 2 , . . . , p n in the plane, and given #, find a maximum cardinality set of pairwise disjoint axisparallel # # squares Q 1 , Q 2 , . . . , Q r . This problem reduces to that of finding a maximum cardinality indepe ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
We consider the following map labelling problem: given distinct points p 1 , p 2 , . . . , p n in the plane, and given #, find a maximum cardinality set of pairwise disjoint axisparallel # # squares Q 1 , Q 2 , . . . , Q r . This problem reduces to that of finding a maximum cardinality independent set in an associated graph called the conflict graph. We describe several heuristics for the maximum cardinality independent set problem, some of which use an LP solution as input. Also, we describe a branchandcut algorithm to solve it to optimality. The standard independent set formulation has an inequality for each edge in the conflict graph which ensures that only one of its endpoints can belong to an independent set. To obtain good starting points for our LPbased heuristics and good upper bounds on the optimal value for our branchandcut algorithm we replace this set of inequalities by the set of inequalities describing all maximal cliques in the conflict graph. For this streng...
Path planning of autonomous underwater vehicles (AUVs) for adaptive sampling
, 2005
"... Abstract—The goal of adaptive sampling in the ocean is to predict the types and locations of additional ocean measurements that would be most useful to collect. Quantitatively, what is most useful is defined by an objective function and the goal is then to optimize this objective under the constrain ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Abstract—The goal of adaptive sampling in the ocean is to predict the types and locations of additional ocean measurements that would be most useful to collect. Quantitatively, what is most useful is defined by an objective function and the goal is then to optimize this objective under the constraints of the available observing network. Examples of objectives are better oceanic understanding, to improve forecast quality, or to sample regions of high interest. This work provides a new pathplanning scheme for the adaptive sampling problem. We define the pathplanning problem in terms of an optimization framework and propose a method based on mixed integer linear programming (MILP). The mathematical goal is to find the vehicle path that maximizes the line integral of the uncertainty of field estimates along this path. Sampling this path can improve the accuracy of the field estimates the most. While achieving this objective, several constraints must be satisfied and are implemented. They relate to vehicle motion, intervehicle coordination, communication, collision avoidance, etc. The MILP formulation is quite powerful to handle different problem constraints and flexible enough to allow easy extensions of the problem. The formulation covers single and multiplevehicle cases as well as singleand multipleday formulations. The need for a multipleday formulation arises when the ocean sampling mission is optimized for several days ahead. We first introduce the details of the formulation, then elaborate on the objective function and constraints, and finally, present a varied set of examples to illustrate the applicability of the proposed method. Index Terms—Adaptive sampling, Autonomous Ocean Sampling Network (AOSN), autonomous underwater vehicle (AUV), data
Algorithms and software for convex mixed integer nonlinear programs, IMA Volumes
"... Abstract. This paper provides a survey of recent progress and software for solving convex mixed integer nonlinear programs (MINLP)s, where the objective and constraints are defined by convex functions and integrality restrictions are imposed on a subset of the decision variables. Convex MINLPs have ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Abstract. This paper provides a survey of recent progress and software for solving convex mixed integer nonlinear programs (MINLP)s, where the objective and constraints are defined by convex functions and integrality restrictions are imposed on a subset of the decision variables. Convex MINLPs have received sustained attention in recent years. By exploiting analogies to wellknown techniques for solving mixed integer linear programs and incorporating these techniques into software, significant improvements have been made in the ability to solve these problems. Key words. Mixed Integer Nonlinear Programming; Branch and Bound; AMS(MOS) subject classifications.
BranchandCut for Combinatorial Optimization Problems without Auxiliary Binary Variables
 KNOWLEDGE ENGINEERING REVIEW
, 2001
"... Many optimization problems involve combinatorial constraints on continuous variables. An example of a combinatorial constraint is that at most one variable in a group of nonnegative variables may be positive. Traditionally, in the mathematical programming community, such problems have been modeled a ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Many optimization problems involve combinatorial constraints on continuous variables. An example of a combinatorial constraint is that at most one variable in a group of nonnegative variables may be positive. Traditionally, in the mathematical programming community, such problems have been modeled as mixedinteger programs by introducing auxiliary binary variables and additional constraints. Because the number of variables and constraints becomes larger and the combinatorial structure is not used to advantage, these mixedinteger programming models may not be solved satisfactorily, except for small instances. Traditionally, constraint programming approaches to such problems keep and use the combinatorial structure, but do not use linear programming bounds in the search for an optimal solution. Here we present a branchandcut approach that considers the combinatorial constraints without the introduction of binary variables. We review the development of this approach and show how strong constraints can be derived using ideas from polyhedral combinatorics. To illustrate the ideas, we present a production scheduling model that arises in the manufacture of fiber optic cables.
Branching on General Disjunctions
 MATHEMATICAL PROGRAMMING
, 2005
"... This paper considers a modification of the branchandcut algorithm for Mixed Integer Linear Programming where branching is performed on general disjunctions rather than on variables. We select promising branching disjunctions based on a heuristic measure of disjunction quality. This measure exploit ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
This paper considers a modification of the branchandcut algorithm for Mixed Integer Linear Programming where branching is performed on general disjunctions rather than on variables. We select promising branching disjunctions based on a heuristic measure of disjunction quality. This measure exploits the relation between branching disjunctions and intersection cuts. In this work, we focus on disjunctions defining the mixed integer Gomory cuts at an optimal basis of the linear programming relaxation. The procedure is tested on instances from the literature. Experiments show that, for a majority of the instances, the enumeration tree obtained by branching on these general disjunctions has a smaller size than the tree obtained by branching on variables, even when variable branching is performed using full strong branching.
Reformulation and Convex Relaxation Techniques for Global Optimization
 4OR
, 2004
"... Many engineering optimization problems can be formulated as nonconvex nonlinear programming problems (NLPs) involving a nonlinear objective function subject to nonlinear constraints. Such problems may exhibit more than one locally optimal point. However, one is often solely or primarily interested i ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
Many engineering optimization problems can be formulated as nonconvex nonlinear programming problems (NLPs) involving a nonlinear objective function subject to nonlinear constraints. Such problems may exhibit more than one locally optimal point. However, one is often solely or primarily interested in determining the globally optimal point. This thesis is concerned with techniques for establishing such global optima using spatial BranchandBound (sBB) algorithms.