Register | Log in | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

euclid's lp [18 articles]

Recent papers added to euclid's library classified by the tag lp. You can also see everyone's lp.
  • Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation
    (11 Sep 2007)
    by Andrea Montanari, Federico Ricci-Tersenghi, Guilhem Semerjian
  • Criss-cross methods: a fresh view on pivot algorithms
    Math. Program., Vol. 79, No. 1-3. (1997), pp. 369-395.
    by Komei Fukuda, Tam&\#225;s Terlaky
    posted to lp by euclid on 2007-06-06 21:41:45 as ** along with 4 groups Algorithms metric_embeddings TCS Polytopes
  • The criss-cross method can take &\#937;(n<sup>d</sup>) pivots
    (2004), pp. 401-408.
    by Bohdan Kaluzny, Komei Fukuda
    posted to lp by euclid on 2007-06-06 21:41:35 as ** along with 4 groups Algorithms metric_embeddings TCS Polytopes
  • Cones of Matrices and Set-Functions and 0--1 Optimization
    SIAM Journal on Optimization, Vol. 1, No. 2. (1991), pp. 166-190.
  • A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover
    by Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani
    posted to lp by euclid on 2006-10-19 22:43:48 as ** along with 4 groups Algorithms metric_embeddings TCS Polytopes
  • Tight Integrality Gaps for Lovasz-Schrijver LP Relaxations of Vertex Cover and Max Cut
    by Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani
    posted to lp by euclid on 2006-10-19 22:42:47 as ** along with 4 groups Algorithms metric_embeddings TCS Polytopes
  • Proving Integrality Gaps without Knowing the Linear Program
    by Sanjeev Arora, Béla Bollobás, László Lovász, Iannis Tourlakis
    posted to lp by euclid on 2006-10-19 22:41:41 as ** along with 4 groups Algorithms metric_embeddings TCS Polytopes
  • Expressing combinatorial optimization problems by Linear Programs
    Journal of Computer and System Sciences, Vol. 43, No. 3. (December 1991), pp. 441-466.
    by Mihalis Yannakakis
  • New $\frac34$-Approximation Algorithms for the Maximum Satisfiability Problem
  • An improved approximation algorithm for multiway cut
    (1998), pp. 48-52.
    by Gruia C&\#259;linescu, Howard Karloff, Yuval Rabani
  • Optimal 3-Terminal Cuts and Linear Programming
    (1999), pp. 114-125.
    by William H Cunningham, Lawrence Tang
  • Linear Programming: Randomization and Abstract Frameworks
  • The many facets of Linear Programming
    by Michael J Todd
  • The arrangement method for Linear Programming
    by Vladlen Koltun
  • Linear Programming: From the encyclopedia of microcomputers
    by Nimrod Meggido
  • Dual integer linear programs and the relationship between their optima
    (1985), pp. 476-483.
    posted to lp by euclid on 2005-11-14 19:43:34 as ** along with 4 groups Algorithms metric_embeddings TCS Polytopes
  • The Efficiency of the Simplex Method: A Survey
    Management Science, Vol. 33, No. 3. (1987), pp. 301-334.
    by Ron Shamir
  • CSC 2411H, Spring 2005: Home Page
    by Avner Megan
  • Note: You may cite this page as: http://www.citeulike.org/user/euclid/tag/lp

    RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.