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:"Continuous relaxation"
Narrow search

Narrow search

Year of publication
Subject
All
Continuous relaxation 6 Mathematical programming 5 Mathematische Optimierung 5 Theorie 5 Theory 5 Closest string problem 2 Ganzzahlige Optimierung 2 Integer programming 2 Level set approach 2 Nonlinear integer optimization 2 Algorithm 1 Algorithmus 1 Branch-and-cut 1 Dual bin packing 1 Heuristics 1 Heuristik 1 Mixed integer optimization 1 Modeling 1 Nichtlineare Optimierung 1 Nichtlineare Regression 1 Nonlinear programming 1 Nonlinear regression 1 Packing 1 Packing problem 1 Packproblem 1 Semidefinite optimization 1 Skiving stock problem 1 The max -cut problem 1
more ... less ...
Online availability
All
Undetermined 4
Type of publication
All
Article 6
Type of publication (narrower categories)
All
Article in journal 5 Aufsatz in Zeitschrift 5
Language
All
English 5 Undetermined 1
Author
All
Hübner, Ruth 2 Schöbel, Anita 2 Arbib, Claudio 1 Della Croce, Federico 1 Fakhimi, Ramin 1 Garraffa, Michele 1 Hicks, Illya V. 1 Martinovic, John 1 Scheithauer, Guntram 1 Sevillio, Mara 1 Terlaky, Tamás 1 Validi, Hamidreza 1 Ventura, Paolo 1 Zuluaga, Luis F. 1
more ... less ...
Published in...
All
Computers & operations research : and their applications to problems of world concern ; an international journal 2 European journal of operational research : EJOR 2 European Journal of Operational Research 1 Operations research letters 1
Source
All
ECONIS (ZBW) 5 RePEc 1
Showing 1 - 6 of 6
Cover Image
On relaxations of the max k-cut problem formulations
Fakhimi, Ramin; Validi, Hamidreza; Hicks, Illya V.; … - In: Operations research letters 51 (2023) 5, pp. 521-527
Persistent link: https://www.econbiz.de/10014495881
Saved in:
Cover Image
An improved integer linear programming formulation for the closest 0-1 string problem
Arbib, Claudio; Sevillio, Mara; Ventura, Paolo - In: Computers & operations research : and their … 80 (2017), pp. 94-100
Persistent link: https://www.econbiz.de/10011645282
Saved in:
Cover Image
Integer linear programming models for the skiving stock problem
Martinovic, John; Scheithauer, Guntram - In: European journal of operational research : EJOR 251 (2016) 2, pp. 356-368
Persistent link: https://www.econbiz.de/10011444324
Saved in:
Cover Image
When is rounding allowed in integer nonlinear optimization?
Hübner, Ruth; Schöbel, Anita - In: European Journal of Operational Research 237 (2014) 2, pp. 404-410
or down) the coordinates of a solution to its continuous relaxation. We call this property rounding property. If it is … continuous relaxation. We also investigate the strong rounding property which allows rounding a solution to the continuous … its continuous relaxation for arbitrary dimensions. …
Persistent link: https://www.econbiz.de/10011097833
Saved in:
Cover Image
The selective fixing algorithm for the closest string problem
Della Croce, Federico; Garraffa, Michele - In: Computers & operations research : and their … 41 (2014), pp. 24-30
Persistent link: https://www.econbiz.de/10010222727
Saved in:
Cover Image
When is rounding allowed in integer nonlinear optimization?
Hübner, Ruth; Schöbel, Anita - In: European journal of operational research : EJOR 237 (2014) 2, pp. 404-410
Persistent link: https://www.econbiz.de/10010380023
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...