Combinatorial Optimization and Integer Linear Programming
نویسندگان
چکیده
Examples: Shortest Path, Traveling Salesman, and many many more. . . Just in bioinformatics: Alignments, Threading, Clone-Probe Mapping, Probe Selection, De Novo Peptide Sequencing, SideChain Placement, Maximum-weight Connected Subgraph in PPI Networks, Genome Rearrangements, Cluster Editing, Finding Regulatory Modules, Finding Approximate Gene Clusters, Haplotyping, and many more. . . Example. Optimal Microarray Probe Selection Experimental setup (group testing): • Goal: determine presence of targets in sample • probes hybridize with targets→ hybridization pattern
منابع مشابه
Technical Report Integer Programming 1 Integer Programming 4
1 To appear as a chapter of the Handbook of Algorithms edited by M. Abstract Integer programming is an expressive framework for modeling and solving discrete optimization problems that arise in a variety of contexts in the engineering sciences. Integer programming representations work with implicit algebraic constraints (linear equations and inequalities on integer valued variables) to capture ...
متن کاملCombinatorial Optimization in Computational Biology
Combinatorial Optimization is a central sub-area in Operations Research that has found many applications in computational biology. In this talk I will survey some of my research in computational biology that uses graph theory, matroid theory, and integer linear programming. The biological applications come from haplotyping, the study of recombination and recombination networks, and phylogenetic...
متن کاملNASA Technical Memorandum 110210 Aerospace Applications of Integer and Combinatorial Optimization
Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in formulating and solving integer and combinatorial optimization problems. Applications range from the design of large space antennas to inter...
متن کاملThe traveling salesman problem: A Linear programming formulation
In this paper, we present a polynomial-sized linear programming formulation of the Traveling Salesman Problem (TSP). The proposed linear program is a network flow-based model. Numerical implementation issues and results are discussed. KeyWords: Linear Programming; Network Optimization; Integer Programming; Traveling Salesman Problem; Combinatorial Optimization; Scheduling; Sequencing.
متن کاملThe traveling salesman problem: A Linear programming formulation of
In this paper, we present a polynomial-sized linear programming formulation of the Traveling Salesman Problem (TSP). The proposed linear program is a network flow-based model. Numerical implementation issues and results are discussed. Key-Words: Linear Programming; Network Optimization; Integer Programming; Traveling Salesman Problem; Combinatorial Optimization; Scheduling; Sequencing. (Forthco...
متن کاملIEOR 269 , Spring 2010 Integer Programming and Combinatorial Optimization
3 Non-linear Objective functions 4 3.1 Production problem with set-up costs . . . . . . . . . . . . . . . . . . . . . . . . . . 4 3.2 Piecewise linear cost function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.3 Piecewise linear convex cost function . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.4 Disjunctive constraints . . . . . . . . . . . . . . . . . . . . . ...
متن کامل