Dennis L. Bricker

According to our database1, Dennis L. Bricker authored at least 14 papers between 1980 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Perfect Duality in Solving Geometric Programming Problems Under Uncertainty.
J. Optim. Theory Appl., 2017

2008
A Dynamic Programming Algorithm for Scheduling In-Vehicle Messages.
IEEE Trans. Intell. Transp. Syst., 2008

Utilizing the Surrogate Dual Bound in Capacity Planning with Economies of Scale.
Algorithmic Oper. Res., 2008

2004
Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs.
Eur. J. Oper. Res., 2004

Generating (n, 2) De Bruijn Sequences with Some Balance and Uniformity Properties.
Ars Comb., 2004

2002
Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming.
Comput. Oper. Res., 2002

Solving Posynomial Geometric Programming Problems via Generalized Linear Programming.
Comput. Optim. Appl., 2002

2000
A multiperiod planning model for the capacitated minimal spanning tree problem.
Eur. J. Oper. Res., 2000

1997
Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach.
Adv. Decis. Sci., 1997

1996
New infeasible interior-point algorithm based on monomial method.
Comput. Oper. Res., 1996

Effectiveness of a geometric programming algorithm for optimization of machining economics models.
Comput. Oper. Res., 1996

1991
Optimal and heuristic solutions to the variable inspection policy problem.
Comput. Oper. Res., 1991

1990
Implementing the Recursive APL Code for Dynamic Programming.
Proceedings of the Conference Proceedings on APL 90: For the Future, 1990

1980
Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual.
Math. Program., 1980


  Loading...