solve < solved < solvent

Facettes :

List of bibliographic references

Number of relevant bibliographic references: 30.
[0-20] [0 - 20][0 - 30][20-29][20-40]

Ident.	Authors (with country if any)	Title
000574 (1996)	Sylvia Sander [Allemagne] ; Günter Henze [Allemagne]	Adsorptive stripping voltammetric determination of vanadium as chloranilic acid complex
000A72 (1991)	Guido Giani [Allemagne] ; Helmut Finner [Allemagne]	Some general results on least favorable parameter configurations with special reference to equivalence testing and the range statistic
000E93 (1994)	R. Horst [Allemagne] ; L. D. Muu [Viêt Nam] ; M. Nast [Allemagne]	Branch-and-bound decomposition approach for solving quasiconvex-concave programs
000F04 (1991)	R. Horst [Allemagne] ; T. Q. Phong [Viêt Nam] ; Ng. V. Thoai [Viêt Nam] ; J. De Vries [Allemagne]	On solving a D.C. programming problem by a sequence of linear programs
000F30 (1991)	Reiner Horst [Allemagne] ; Nguyen V. Thoai [Viêt Nam] ; Harold P. Benson [États-Unis]	Concave minimization via conical partitions and polyhedral outer approximation
000F45 (1990)	Reiner Horst [Allemagne] ; Thai Q. Phong [Viêt Nam] ; Nguyen V. Thoai	On solving general reverse convex programming problems by a sequence of linear programs and line searches
001009 (1993)	Klaus Jansen [Allemagne]	On scheduling problems restricted to interval orders
001033 (1991)	Nguyen Van Thoai [Allemagne]	A global optimization approach for solving the convex multiplicative programming problem
001064 (1993)	Klaus Jansen [Allemagne]	Scheduling with constrained processor allocation for interval orders
001076 (1990)	Ekkehard W. Sachs [Allemagne]	Convergence of algorithms for perturbed optimization problems
001096 (2008)	Dieter Sadowski [Allemagne] ; Peter Schneider [Allemagne] ; Nicole Thaller [Allemagne]	Do We Need Incentives for PhD Supervisors?
001105 (1993)	Klaus Jansen ; Petra Scheffler	Generalized coloring for tree-like graphs
001158 (1997)	Klaus Jansen [Allemagne] ; Petra Scheffler [Allemagne]	Generalized coloring for tree-like graphs
001191 (2002)	Horst Tempelmeier [Allemagne]	A SIMPLE HEURISTIC FOR DYNAMIC ORDER SIZING AND SUPPLIER SELECTION WITH TIME‐VARYING DATA
001219 (1988)	R. Horst [Allemagne]	Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization
001221 (1984)	Jürgen Voigt [Allemagne]	positivity in time dependent linear transport theory
001309 (1997)	Klaus Jansen [Allemagne]	The optimum cost chromatic partition problem
001401 (1997)	Klaus Jansen [Allemagne] ; Joachim Reiter [Allemagne]	A new approximation algorithm for the register allocation problem
001420 (1998)	K. Jansen [Allemagne] ; J. Reiter [Allemagne]	An approximation algorithm for the register allocation problem
001458 (2004)	Mohammad Ghasemzadeh [Allemagne] ; Volker Klotz [Allemagne] ; Christoph Meinel [Allemagne]	Embedding Memoization to the Semantic Tree Search for Deciding QBFs
001572 (1992)	Faiz A. Al-Khayyal [États-Unis] ; Reiner Horst [Allemagne] ; Panos M. Pardalos [États-Unis]	Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Curation

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i -k "solved" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i  \
                -Sk "solved" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Istex
   |étape=   Curation
   |type=    indexItem
   |index=    AbsEn.i
   |clé=    solved
}}

---

This area was generated with Dilib version V0.6.31. Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024