Solving zero-one multiple objective programs through implicit enumeration

Deckro, Richard F.; Winkofsky, E.P.

doi:10.1016/0377-2217(83)90157-1

Cited by 32 publications

(13 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Pasternak and Passy (1973), Bitran (1977Bitran ( , 1979, Deckro and Winkofsky (1983), Bitran and Riviera (1982), Kiziltan and Yucaoglu (1983) and White (1984) -for multiobjective 0-1 programming; • Klein and Hannan (1982), Villareal and Karwan (1981), Chalmet et al (1986) and Sylva and Crema (2004) -for multiobjective all-integer programming.…”

Section: Non-interactive Versus Interactive Methodsmentioning

confidence: 99%

A review of interactive methods for multiobjective integer and mixed-integer programming

Alves

Clímaco

2007

European Journal of Operational Research

140

View full text Add to dashboard Cite

This paper makes a review of interactive methods devoted to multiobjective integer and mixed-integer programming (MOIP/MOMIP) problems. The basic concepts concerning the characterization of the non-dominated solution set are first introduced, followed by a remark about non-interactive methods vs. interactive methods. Then, we focus on interactive MOIP/MOMIP methods, including their characterization according to the type of preference information required from the decision maker, the computing process used to determine non-dominated solutions and the interactive protocol used to communicate with the decision maker. We try to draw out some contrasts and similarities of the different types of methods.

show abstract

Section: Non-interactive Versus Interactive Methodsmentioning

confidence: 99%

A review of interactive methods for multiobjective integer and mixed-integer programming

Alves

Clímaco

2007

European Journal of Operational Research

140

View full text Add to dashboard Cite

show abstract

“…see respectively, Deckro and Winkofsky, 1983;and Klein and Hannan, 1982). The set is finite in this case.…”

Section: Inherent and Cb Related Advantages And Drawbacks Of Non Itermentioning

confidence: 96%

“…In this case the entire set of efficient solutions to the problem can be determined (Klein and Hannan, 1982;and Deckro and Winkofsky, 1983). This, however, may not be practicable for large problems when long computational times may be required and the number of solutions determined could also prove substantial.…”

Section: The Non Iterative Ivfamentioning

confidence: 99%

Selecting a Suitable Solution Method for a Multi Objective Programming Capital Budgeting Problem

Thanassoulis

1985

Business Fin & Account

View full text Add to dashboard Cite

“…Finding E q (s; X) for any s P S is a 0±1 efficient solution problem for which the papers by Pasternak and Passy (1973), Bitran (1977Bitran ( , 1979, Hartley (1979), Dekro and Winkofsky (1983) and Habernicht (1983) are relevant.…”

Section: A 0±1 Portfolio Problemmentioning

confidence: 99%

A parametric characterization of mean-variance efficient solutions for general feasible action sets

White

1998

J. Multi-Crit. Decis. Anal.

View full text Add to dashboard Cite

show abstract

Solving zero-one multiple objective programs through implicit enumeration

Cited by 32 publications

References 9 publications

A review of interactive methods for multiobjective integer and mixed-integer programming

A review of interactive methods for multiobjective integer and mixed-integer programming

Selecting a Suitable Solution Method for a Multi Objective Programming Capital Budgeting Problem

A parametric characterization of mean-variance efficient solutions for general feasible action sets

Contact Info

Product

Resources

About