EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"linear and semidefinite programming"
Narrow search

Narrow search

Year of publication
Subject
All
linear and semidefinite programming 2 Approximation algorithms 1 Computational complexity 1 Global optimization 1 Lieferkette 1 Linear and semidefinite programming 1 Logit model 1 Logit-Modell 1 Mathematical programming 1 Mathematische Optimierung 1 Operations and Supply Chains 1 Retail assortment 1 Sortiment 1 Supply chain 1 Theorie 1 Theory 1 approximation algorithms 1 assortment optimization 1 computational complexity 1 global optimization 1 submodularity 1
more ... less ...
Online availability
All
Undetermined 2 Free 1
Type of publication
All
Article 2 Book / Working Paper 1
Type of publication (narrower categories)
All
Article in journal 1 Aufsatz in Zeitschrift 1
Language
All
Undetermined 2 English 1
Author
All
Ghuge, Rohan 1 Klerk, Etienne 1 Kwon, Joseph 1 Nagarajan, Viswanath 1 Sharma, Adetee 1 de Klerk, Etienne 1
Institution
All
Tilburg University, Center for Economic Research 1
Published in...
All
Central European Journal of Operations Research 1 Discussion Paper / Tilburg University, Center for Economic Research 1 Operations research 1
Source
All
RePEc 2 ECONIS (ZBW) 1
Showing 1 - 3 of 3
Cover Image
Constrained assortment optimization under the paired combinatorial logit model
Ghuge, Rohan; Kwon, Joseph; Nagarajan, Viswanath; … - In: Operations research 70 (2022) 2, pp. 786-804
Persistent link: https://www.econbiz.de/10013365779
Saved in:
Cover Image
The Complexity of Optimizing over a Simplex, Hypercube or Sphere : A Short Survey
de Klerk, Etienne - Tilburg University, Center for Economic Research - 2006
We consider the computational complexity of optimizing various classes of continuous functions over a simplex, hypercube or sphere.These relatively simple optimization problems have many applications.We review known approximation results as well as negative (inapproximability) results from the...
Persistent link: https://www.econbiz.de/10011092404
Saved in:
Cover Image
The complexity of optimizing over a simplex, hypercube or sphere: a short survey
Klerk, Etienne - In: Central European Journal of Operations Research 16 (2008) 2, pp. 111-125
Persistent link: https://www.econbiz.de/10008515711
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...