D. J. White

From MaRDI portal
Person:181183

Available identifiers

zbMath Open white.douglas-johnMaRDI QIDQ181183

List of research outcomes





PublicationDate of PublicationType
\(p\)th power Lagrangian method for integer programming2001-06-14Paper
Epsilon-dominating solutions in mean-variance portfolio analysis2001-05-13Paper
Rainbow colourings of chains2001-04-17Paper
Lagrangean ralaxation revisited. (Technical note)1999-09-02Paper
The maximization of a function over the efficient set via a penalty function approach1999-04-27Paper
Epsilon dominance and constraint partitioning in multiple objective problems1999-03-18Paper
A parametric characterization of mean-variance efficient solutions for general feasible action sets1998-09-27Paper
A special class parametric of knapsack problems: Analytic aids and heuristics1998-07-14Paper
Penalty function approach to linear trilevel programming1998-03-05Paper
https://portal.mardi4nfdi.de/entity/Q43984641998-01-01Paper
Maximising a Function Over a Finite Set of Actions—Technical Note1997-12-15Paper
On a Markov Decision Process problem involving the Maximum of the Difference between two functions: Technical Note1997-04-22Paper
https://portal.mardi4nfdi.de/entity/Q56880111997-01-06Paper
Mean-Variance Analysis in Infinite Horizon Non-Discounted Markov Decision Processes: Technical Note1996-12-08Paper
A multiple‐objective dispersion problem1996-11-25Paper
A Lagrangean Relaxation Approach for a Turbine Design Quadratic Assignment Problem1996-10-28Paper
https://portal.mardi4nfdi.de/entity/Q48882061996-09-18Paper
https://portal.mardi4nfdi.de/entity/Q48878371996-08-06Paper
Decision Roll and Horizon Roll Processes in Infinite Horizon Discounted Markov Decision Processes1996-08-05Paper
Solving bi-level linear programmes1996-08-05Paper
Finite Horizon Markov Decision Processes with Uncertain Terminal Payoffs1996-03-07Paper
Rectilinear Location Revisited1996-03-07Paper
Structural properties for contracting state partially observable Markov decision processes1996-01-18Paper
https://portal.mardi4nfdi.de/entity/Q43001001996-01-17Paper
Multilevel programming, rational reaction sets, and efficient solutions1996-01-07Paper
A direct constructive proof of a known result on total unimodularity, and a characterisation of related partitions1995-11-05Paper
A superharmonic approach to solving infinite horizon partially observable Markov decision problems1995-05-14Paper
Multiple‐objective weighting factor auxiliary optimization problems1995-01-01Paper
Strengthening Gilmore's bound for the quadratic assignment problem1994-09-15Paper
https://portal.mardi4nfdi.de/entity/Q43000981994-09-08Paper
Finding Optimal Survey Policies via Adaptive Markov Decision Processes1994-08-02Paper
Extension of the Frank-Wolfe algorithm to concave nondifferentiable objective functions1994-07-25Paper
The convergence of value iteration in discounted Markov decision processes1994-06-08Paper
The Use of Specially Structured Models for Obtaining Bounds in the Quadratic Assignment Problem1994-05-05Paper
A Survey of Applications of Markov Decision Processes1994-04-12Paper
A mathematical programming approach to a problem in variance penalised Markov decision processes1994-03-17Paper
A penalty function approach for solving bi-level linear programs1994-01-13Paper
Location of Two Facilities with Minimal Separation1994-01-02Paper
https://portal.mardi4nfdi.de/entity/Q31350961993-09-22Paper
Solving Infinite-Horizon Discounted Markov Games Using a Superharmonic Least-Element Algorithm1993-09-15Paper
Minimising a threshold probability in discounted Markov decision processes1993-08-26Paper
An Heuristic for Multi-Dimensional Markov Decision Processes1993-08-23Paper
Markov decision processes: Discounted expected reward or average expected reward?1993-08-19Paper
https://portal.mardi4nfdi.de/entity/Q52871811993-08-15Paper
A convex form of the quadratic assignment problem1993-06-29Paper
A linear programming approach to solving bilinear programmes1993-04-01Paper
Piecewise Linear Approximations for Partially Observable Markov Decision Processes with Finite Horizons1993-02-25Paper
A complementary greedy heuristic for the knapsack problem1993-02-18Paper
Computational approaches to variance-penalised Markov decision processes1993-01-16Paper
A Vector Minimum Superharmonic Approach to Solving Infinite-Horizon Discounted Markov Decision Processes1992-12-16Paper
A Min-Max-Max-Min Approach to Solving a Stochastic Programming Problem with Simple Recourse1992-09-27Paper
A conjecture of Ross for a search problem1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39912841992-06-28Paper
An extension of a greedy heuristic for the knapsack problem1992-06-26Paper
The maximal dispersion problem and the ``first point outside the neighbourhood heuristic1991-01-01Paper
A characterisation of the feasible set of objective function vectors in linear multiple objective problems1991-01-01Paper
A solution method for the linear static Stackelberg problem using penalty functions1990-01-01Paper
A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods1990-01-01Paper
A Note on: An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57537551990-01-01Paper
Least elements revisited1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30346251989-01-01Paper
Solving infinite horizon discounted Markov decision process problems for a range of discount factors1989-01-01Paper
Markov decision processes1989-01-01Paper
Separable value functions for infinite horizon average reward Markov decision processes1989-01-01Paper
The ``largest element first heuristic for the maximization assignment problem1989-01-01Paper
Using weighting vectors to solve multiple attribute problems: A framework1989-01-01Paper
Repair limit replacement1989-01-01Paper
Mean, variance and probabilistic criteria in finite Markov decision processes: A review1988-01-01Paper
Weighting factor extensions for finite multiple objective vector minimization problems1988-01-01Paper
Discount-isotone policies for Markov decision processes1988-01-01Paper
Infinite horizon Markov decision processes with unknown or variable discount factors1987-01-01Paper
Decomposition in multi-item inventory control1987-01-01Paper
Utility, probabilistic constraints, mean and variance of discounted rewards in Markov decision processes1987-01-01Paper
Epsilon efficiency1986-01-01Paper
Vector maximisation and lagrange multipliers1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37753211985-01-01Paper
A multiple objective interactive Lagrangean relaxation approach1985-01-01Paper
Characterizations of efficient sets by constrained objectives1985-01-01Paper
A modification of the Geoffrion/Dyer/Feinberg algorithm for finite multi- objective systems1985-01-01Paper
Approximating Markov decision processes using expected state transitions1985-01-01Paper
Monotone value iteration for discounted finite Markov decision processes1985-01-01Paper
Multiobjective programming and penalty functions1984-01-01Paper
A Special Multi-Objective Assignment Problem1984-01-01Paper
A branch and bound method for multi-objective Boolean problems1984-01-01Paper
Isotone policies for the value iteration method for Markov decision processes1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37036481983-01-01Paper
Concepts of proper efficiency1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33254351983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33292391983-01-01Paper
The Determination of Approximately Optimal Policies in Markov Decision Processes by the Use of Bounds1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51870951982-01-01Paper
Finite state approximations for denumerable state infinite horizon discounted Markov decision processes with unbounded rewards1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39325681982-01-01Paper
Multi-objective infinite-horizon discounted Markov decision processes1982-01-01Paper
Negatively isotone optimal policies for random walk type Markov decision processes1982-01-01Paper
A multi-objective version of Bellman's inventory problem1982-01-01Paper
Isotone optimal policies for structured Markov decision processes1981-01-01Paper
Rational solution axioms and efficient sets1981-01-01Paper
Finite-state approximations for denumerable-state infinite-horizon discounted Markov decision processes1980-01-01Paper
Optimality and efficiency. I1980-01-01Paper
Notes in decision theory: Optimality and efficiency. II1980-01-01Paper
Multi-Objective Interactive Programming1980-01-01Paper
Technical Note—Generalized Efficient Solutions for Sums of Sets1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38564501979-01-01Paper
Finite state approximation for denumerable-state infinite horizon contracted Markov decision processes: The policy space method1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38675411978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39087951978-01-01Paper
A structured optimal route policy1978-01-01Paper
Kernels of Preference Structures1977-01-01Paper
Note—An Analogue Derivation of the Dual of the General Fermat Problem1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41610111976-01-01Paper
Allocation of Marketing Effort1975-01-01Paper
Duality, Indifference and Sensitivity Analysis in Multiple Objective Linear Programming1975-01-01Paper
A Note on Faculty Timetabling1975-01-01Paper
Entropy and Decision1975-01-01Paper
An inductive proof of a fundamental maximin theorem1975-01-01Paper
Dynamic programming and duality in linear programming1975-01-01Paper
A Linear Programming Analogue, a Duality Theorem, and a Dynamic Algorithm1974-01-01Paper
Technical Note—Dynamic Programming and Probabilistic Constraints1974-01-01Paper
An Example of Loosely Coupled Stages in Dynamic Programming1973-01-01Paper
An Imbedding Approach to Additive Value Zero-One Problems1973-01-01Paper
Envelope programming and a minimax theorem1972-01-01Paper
Uncertain Value Functions1972-01-01Paper
Functions Preserving Compactness and Connectedness1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56122451969-01-01Paper
Dynamic programming and Systems of Uncertain Duration: A Markov model1969-01-01Paper
Plane sets with intersections of prescribed power1968-01-01Paper
Functions Preserving Compactness and Connectedness Are Continuous1968-01-01Paper
Forecasts and decisionmaking1966-01-01Paper
Dynamic Programming and Systems of Uncertain Duration1965-01-01Paper
Dynamic programming, Markov chains, and the method of successive approximations1963-01-01Paper
Optimal revision periods1962-01-01Paper

Research outcomes over time

This page was built for person: D. J. White