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:"Quadratic 0–1 programming"
Narrow search

Narrow search

Year of publication
Subject
All
Mathematical programming 2 Mathematische Optimierung 2 Quadratic 0-1 programming 2 Algorithm 1 Algorithmus 1 Branch-and-bound method 1 Bundling strategy 1 Global optimality condition 1 Global optimization 1 Graph theory 1 Graphentheorie 1 Half-products 1 Lagrangean decomposition 1 Lagrangian duality 1 Lagrangian relaxation 1 Leistungsbündel 1 Lower bounds 1 Nonlinear integer programming 1 Optimality condition 1 Quadratic 0–1 programming 1 Quadratic programming 1 Spanning trees 1 Theorie 1 Theory 1 Variable fixation 1 bundle method 1 convex reformulation 1 densest subgraph 1 k-cluster 1 mixed integer programming 1 quadratic 0-1 programming 1 quadratic 0–1 programming 1 semidefinite programming 1 subgradient algorithm 1
more ... less ...
Online availability
All
Undetermined 4
Type of publication
All
Article 5
Type of publication (narrower categories)
All
Article in journal 2 Aufsatz in Zeitschrift 2
Language
All
Undetermined 3 English 2
Author
All
Billionnet, Alain 1 Chardaire, Pierre 1 Chen, Wei 1 Cunha, Alexandre Salles da 1 Elloumi, Sourour 1 Gendreau, Michel 1 Lambert, Amélie 1 Li, D. 1 Liu, C. 1 Pereira, Dilson Lucas 1 Sun, X. 1 Sutter, Alain 1 Wiegele, Angelika 1 Zhang, Liansheng 1
more ... less ...
Published in...
All
Journal of Global Optimization 2 Computers & operations research : and their applications to problems of world concern ; an international journal 1 INFORMS journal on computing : JOC 1 Management Science 1
Source
All
RePEc 3 ECONIS (ZBW) 2
Showing 1 - 5 of 5
Cover Image
Using a Conic Bundle method to accelerate both phases of a quadratic convex reformulation
Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie; … - In: INFORMS journal on computing : JOC 29 (2017) 2, pp. 318-331
Persistent link: https://www.econbiz.de/10011691204
Saved in:
Cover Image
Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
Pereira, Dilson Lucas; Gendreau, Michel; Cunha, … - In: Computers & operations research : and their … 63 (2015), pp. 149-160
Persistent link: https://www.econbiz.de/10011344140
Saved in:
Cover Image
An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach
Li, D.; Sun, X.; Liu, C. - In: Journal of Global Optimization 52 (2012) 4, pp. 797-829
Persistent link: https://www.econbiz.de/10010845828
Saved in:
Cover Image
Global optimality conditions for quadratic 0-1 optimization problems
Chen, Wei; Zhang, Liansheng - In: Journal of Global Optimization 46 (2010) 2, pp. 191-206
Persistent link: https://www.econbiz.de/10008591045
Saved in:
Cover Image
A Decomposition Method for Quadratic Zero-One Programming
Chardaire, Pierre; Sutter, Alain - In: Management Science 41 (1995) 4, pp. 704-712
This paper proposes a decomposition method to compute a lower bound for unconstrained quadratic zero-one minimization. First, we show that any quadratic function can be expressed as a sum of particular quadratic functions whose minima can be computed by a simple branch and bound algorithm. Then,...
Persistent link: https://www.econbiz.de/10009214386
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...