Skip to Main Content (Press Enter)
×
Home
Persone
Pubblicazioni
Strutture
Competenze
IT
EN
☰
UNI-FIND
|
UNI-FIND
cnr.it
IT
EN
×
Home
Persone
Pubblicazioni
Strutture
Competenze
☰
Pubblicazioni
MATHEMATICAL PROGRAMMING
Rivista
Codice:
E106809
ISSN:
0025-5610
Dati Generali
Dati Generali
Pubblicazioni (27)
Pulisci
Ordina Pubblicazioni:
ascendente
decrescente
A Stabilized Structured Dantzig-Wolfe Decomposition Method
Articolo
A Storm of Feasibility Pumps for Nonconvex MINLP
Articolo
A magnetic resonance device designed via global optimization techniques
Articolo
A magnetic resonance device designed via global optimization techniques
Articolo
An accelerated central cutting plane algorithm for linear semi-infinite programming
Articolo
Automatic Dantzig-Wolfe reformulation of mixed integer programs
Articolo
Bilinear programming: an exact algorithm
Articolo
Budgeted Matching and Budgeted Matroid Intersection via the Gasoline Puzzle
Articolo
Bundle methods for sum-functions with "easy" components: Applications to multicommodity network design
Articolo
Combinatorial Optimization
Curatela
Combinatorial Optimization and Integer Programming
Articolo
Easy and Difficult Objective Functions for Max Cut
Articolo
Index Information Algorithm with Local Tuning for Solving Multidimensional Global Optimization Problems with Multiextremal Constraints
Articolo
Lifting and Separation Procedures for the Cut Polytope
Articolo
Max Horn SAT and the Minimum Cut Problem in Directed Hypergraphs
Articolo
New Approaches for Optimizing over the Semimetric Polytope
Articolo
Objective-derivative-free methods for constrained optimization
Articolo
On the Chromatic Polynomial of a Graph
Articolo
Optimization via enumeration: a new algorithm for the Max Cut problem
Articolo
Perspective cuts for a class of convex 0-1 mixed integer programs
Articolo
Preface
Capitolo di libro
Primal Separation for 0/1 Polytopes
Articolo
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
Articolo
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
Articolo
SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances
Articolo
The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs
Articolo
The relation of time indexed formulations of single machine scheduling problems to the node packing problem
Articolo
No Results Found
«
‹
{pageNumber}
›
»
{startItem} - {endItem} di {itemsNumber}
5 per pagina
10 per pagina
30 per pagina
vedi tutti
