Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Lagrangian bound (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2007 (1) 2009 (1) 2010 (1)
Publication types (Num. hits)
article(3)
Venues (Conferences, Journals, ...)
IEEE Communications Letters(1) J. Comb. Optim.(1) Optimization Letters(1)
Authors
Gregor von Bochmann(1) Hoang Tuy(1) Igor S. Litvinchev(1) James Yiming Zhang(1) Jania Saucedo(1) Jing Wu(1) Michel Savoie(1) Socorro Rangel(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2 occurrences of 2 keywords
Results
Found 3 publication records. Showing 3 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Igor S. Litvinchev, Socorro Rangel, Jania Saucedo A Lagrangian bound for many-to-many assignment problems. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1James Yiming Zhang, Jing Wu, Gregor von Bochmann, Michel Savoie A proof of wavelength conversion not improving the lagrangian bound of the static RWA problem. Search on Bibsonomy IEEE Communications Letters The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hoang Tuy On a decomposition method for nonconvex global optimization. Search on Bibsonomy Optimization Letters The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Nonconvex global optimization, Partly convex, Partly monotonic, Monotonic/linear problems, Branch and bound decomposition algorithm, Lagrangian bound, Convergence conditions, Parametric optimization, Duality gap
Displaying result #1 - #3 of 3 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.