Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computational optimization and applications
1. Verfasser: Hifi, M. (VerfasserIn)
Weitere Verfasser: M'Hallah, Rym (VerfasserIn), Saadi, T. (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2009
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
The piecewise linear-quadratic model for computational convex analysis 2009 Lucet, Yves
Finite-difference discretizations of quadratic control problems governed by ordinary elliptic differential equations 2009 Alt, Walter
Global error bounds for the extended vertical LCP 2009 Zhang, Chao
Bounded-degree spanning tree problems : models and new algotithms 2009 Cerulli, Raffaele
Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints 2009 Izmailov, A. F.
A smoothing projected Newton-type algorithm for semi-infinite programming 2009
A regularization method for the numerical solution of elliptic boundary control problems with pointwise state constraints 2009 Tröltzsch, Fredi
Reconstructing (0,1)-matrices from projections using integer programming 2009 Dahl, Geir
Sum of squares method for sensor network localization 2009 Nie, Jiawang
Globally solving box-constrained nonconvex quadratic programs with semidefinite-based definite branch-and-bound 2009 Burer, Samuel
A virtual control concept for state constrained optimal control problems 2009 Krumbiegel, Klaus
An inexact-restoration method for nonlinear bilevel programming problems 2009
Analytic center of spherical shells and its application to analytic center machine 2009 Raupp, Fernanda Maria Pereira
Towards auction algorithms for large dense assignment problems 2009 Buš, Libor
New efficient shortest path simplex algorithm : pseudo permanent labels instead of permanent labels 2009 Sedeño-Noda, A.
A restarting approach for the symmetric rank one update for unconstrained optimization 2009 Leong, Wah June
Benders, metric and cutset inequalities for multicommodity capacitated network design 2009 Costa, Alysson M.
Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods 2009 Fernández, José
Convergent Lagrangian and domain cut method for nonlinear knapsack problems 2009
Scenario reduction in stochastic programming with respect to discrepancy distances 2009 Henrion, René
Alle Artikel auflisten