DISOPT 2008 - PDF Preprint Papers

DISOPT 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DISOPT-2008 Paper

click to vote

DISOPT
2008

138views more DISOPT 2008»

An algorithmic framework for convex mixed integer nonlinear programs

13 years 11 months ago

Download integer.tepper.cmu.edu

This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...

Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, ...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	138	An algorithmic framework for convex mixed integer nonlinear programs	claim
2	118	Approximation algorithm for minimizing total latency in machine scheduling with deliveries	claim
3	113	The inverse 1-median problem on a cycle	claim
4	107	The k-path tree matroid and its applications to survivable network design	claim
5	99	Computing robust basestock levels	claim
6	93	Exploiting planarity in separation routines for the symmetric traveling salesman problem	claim
7	91	Partition inequalities for capacitated survivable network design based on directed p-cycles	claim
8	89	A pricing problem under Monge property	claim
9	89	Complexity of the min-max (regret) versions of min cut problems	claim
10	89	Group sequencing around a common due date	claim
11	88	New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability	claim
12	87	A Branch and Price algorithm for the k-splittable maximum flow problem	claim
13	85	How tight is the corner relaxation?	claim
14	82	Note on pseudolattices, lattices and submodular linear programs	claim
15	81	Intermediate integer programming representations using value disjunctions	claim
16	78	N-fold integer programming	claim
17	74	George B. Dantzig and systems optimization	claim
18	71	The Grothendieck constant of random and pseudo-random graphs	claim
19	69	An algorithm to increase the node-connectivity of a digraph by one	claim
20	66	Worst case examples of an exterior point algorithm for the assignment problem	claim
21	66	George Dantzig's contributions to integer programming	claim
22	61	A generalization of the integer linear infeasibility problem	claim
23	59	Nonconvex, lower semicontinuous piecewise linear optimization	claim
24	59	More on online bin packing with two item sizes	claim
25	55	A sequential elimination algorithm for computing bounds on the clique number of a graph	claim
26	53	Recent results on well-balanced orientations	claim
27	51	Fair cost allocations under conflicts - a game-theoretic point of view -	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers