default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. B. G. Frenk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j38]J. B. G. Frenk
, Sonya Javadi, Morteza Pourakbar, Semih Onur Sezer:
An exact static solution approach for the service parts end-of-life inventory problem. Eur. J. Oper. Res. 272(2): 496-504 (2019)- [j37]J. B. G. Frenk, Sonya Javadi, Semih Onur Sezer:
An optimal stopping approach for the end-of-life inventory problem. Math. Methods Oper. Res. 90(3): 329-363 (2019) - [j36]J. B. G. Frenk, Canan Pehlivan, Semih Onur Sezer:
Order and exit decisions under non-increasing price curves for products with short life cycles. Math. Methods Oper. Res. 90(3): 365-397 (2019) - 2017
- [j35]J. B. G. Frenk, Behrooz Pourghannad, Semih Onur Sezer:
A Static Model in Single Leg Flight Airline Revenue Management. Transp. Sci. 51(1): 214-232 (2017) - 2015
- [j34]A. Muzaffer Arslan, J. B. G. Frenk, Semih Onur Sezer:
On the single-leg airline revenue management problem in continuous time. Math. Methods Oper. Res. 81(1): 27-52 (2015) - 2014
- [j33]S. Ilker Birbil, J. B. G. Frenk, Joaquim A. S. Gromicho, Shuzhong Zhang:
A Network Airline Revenue Management Framework Based on Decomposition by Origins and Destinations. Transp. Sci. 48(3): 313-333 (2014) - 2013
- [j32]Nursen Aydin, S. Ilker Birbil, J. B. G. Frenk, Nilay Noyan:
Single-Leg Airline Revenue Management with Overbooking. Transp. Sci. 47(4): 560-583 (2013) - 2012
- [j31]Huseyin Topaloglu, S. Ilker Birbil, J. B. G. Frenk, Nilay Noyan:
Tractable Open Loop Policies for Joint Overbooking and Capacity Control Over a Single Flight Leg with Multiple Fare Classes. Transp. Sci. 46(4): 460-481 (2012)
2000 – 2009
- 2009
- [j30]S. Ilker Birbil, J. B. G. Frenk, Joaquim A. S. Gromicho, Shuzhong Zhang:
The Role of Robust Optimization in Single-Leg Airline Revenue Management. Manag. Sci. 55(1): 148-163 (2009) - 2007
- [j29]J. B. G. Frenk:
A note on the paper "Fractional programming with convex quadratic forms and functions" by H.P. Benson. Eur. J. Oper. Res. 176(1): 641-642 (2007) - [j28]Z. Pelin Bayindir, S. Ilker Birbil, J. B. G. Frenk:
A deterministic inventory/production model with general inventory cost rate function and piecewise linear concave production costs. Eur. J. Oper. Res. 179(1): 114-123 (2007) - [j27]S. Ilker Birbil, J. B. G. Frenk, Georg J. Still:
An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming. Eur. J. Oper. Res. 180(1): 479-484 (2007) - 2006
- [j26]S. Ilker Birbil, Gemayqzel Bouza, J. B. G. Frenk, Georg J. Still:
Equilibrium constrained optimization problems. Eur. J. Oper. Res. 169(3): 1108-1127 (2006) - [j25]Z. Pelin Bayindir, S. Ilker Birbil, J. B. G. Frenk:
The joint replenishment problem with variable production costs. Eur. J. Oper. Res. 175(1): 622-640 (2006) - [j24]J. B. G. Frenk, Gábor Kassay:
The level set method of Joó and its use in minimax theory. Math. Program. 105(1): 145-155 (2006) - 2005
- [j23]S. Ilker Birbil, Shu-Cherng Fang, J. B. G. Frenk, Shuzhong Zhang:
Recursive approximation of the high dimensional max function. Oper. Res. Lett. 33(5): 450-458 (2005) - 2004
- [j22]J. B. G. Frenk, Gábor Kassay, József J. Kolumbán:
On equivalent results in minimax theory. Eur. J. Oper. Res. 157(1): 46-58 (2004)
1990 – 1999
- 1999
- [j21]János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang:
Two Simple Algorithms for bin Covering. Acta Cybern. 14(1): 13-25 (1999) - [j20]J. B. G. Frenk, Marcel J. Kleijn, Rommert Dekker:
An efficient algorithm for a generalized joint replenishment problem. Eur. J. Oper. Res. 118(2): 413-428 (1999) - 1998
- [j19]Carlton H. Scott, Thomas R. Jefferson, J. B. G. Frenk:
A Duality Theory for a Class of Generalized Fractional Programs. J. Glob. Optim. 12(3): 239-245 (1998) - 1997
- [j18]Ana Isabel Barros, Rommert Dekker, J. B. G. Frenk, S. van Weeren:
Optimizing a General Optimal Replacement Model by Fractional Programming Techniques. J. Glob. Optim. 10(4): 405-423 (1997) - 1996
- [j17]Ana Isabel Barros, J. B. G. Frenk, Siegfried Schaible, Shuzhong Zhang:
Using duality to solve generalized fractional programming problems. J. Glob. Optim. 8(2): 139-170 (1996) - [j16]Ana Isabel Barros, J. B. G. Frenk, Siegfried Schaible, Shuzhong Zhang:
A new algorithm for generalized fractional programs. Math. Program. 72: 147-175 (1996) - 1994
- [j15]J. B. G. Frenk, Joaquim A. S. Gromicho, Shuzhong Zhang:
A deep cut ellipsoid algorithm for convex programming: Theory and applications. Math. Program. 63: 83-108 (1994) - 1993
- [j14]Gábor Galambos, J. B. G. Frenk:
A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the Extension to the Parametric Case. Discret. Appl. Math. 41(2): 173-178 (1993) - [j13]János Csirik, J. B. G. Frenk, Martine Labbé:
Two-Dimensional Rectangle Packing: On-Line Methods and Results. Discret. Appl. Math. 45(3): 197-204 (1993) - [j12]J. B. G. Frenk, Martine Labbé, Shuzhong Zhang:
A note on a stochastic location problem. Oper. Res. Lett. 13(4): 213-214 (1993) - 1991
- [j11]János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang:
Heuristic for the 0-1 Min-Knapsack Problem. Acta Cybern. 10(1-2): 15-20 (1991) - [j10]János Csirik, J. B. G. Frenk, Gábor Galambos, A. H. G. Rinnooy Kan:
Probabilistic Analysis of Algorithms for Dual Bin Packing Problems. J. Algorithms 12(2): 189-203 (1991) - 1990
- [j9]János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang:
On the multidimensional vector bin packing. Acta Cybern. 9(4): 361-369 (1990)
1980 – 1989
- 1987
- [j8]J. B. G. Frenk, M. van Houweninge, Alexander H. G. Rinnooy Kan:
Order statistics and the linear assignment problem. Computing 39(2): 165-174 (1987) - [j7]J. B. G. Frenk, Gábor Galambos:
Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem. Computing 39(3): 201-217 (1987) - [j6]J. B. G. Frenk, A. H. G. Rinnooy Kan:
The Asymptotic Optimality of the LPT Rule. Math. Oper. Res. 12(2): 241-254 (1987) - 1986
- [j5]J. B. G. Frenk, A. H. G. Rinnooy Kan:
The rate of convergence to optimality of the LPT rule. Discret. Appl. Math. 14(2): 187-197 (1986) - 1985
- [j4]J. B. G. Frenk, M. van Houweninge, A. H. G. Rinnooy Kan:
Asymptotic Properties of the Quadratic Assignment Problem. Math. Oper. Res. 10(1): 100-116 (1985) - 1984
- [j3]J. B. G. Frenk, A. H. G. Rinnooy Kan, Leen Stougie:
A hierarchical scheduling problem with a well-solvable second stage. Ann. Oper. Res. 1(1): 43-58 (1984) - 1983
- [j2]W. B. van Dam, J. B. G. Frenk, Alexander H. G. Rinnooy Kan:
The asymptotic behaviour of a distributive sorting method. Computing 31(4): 287-303 (1983) - [j1]W. B. van Dam, J. B. G. Frenk, Jan Telgen:
Randomly generated polytopes for testing mathematical programming algorithms. Math. Program. 26(2): 172-181 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
