Exact and Approximate Solution of Constrained Dynamic Combinatorial Problems in Space

Robert E. Kuenne
Additional contact information
Robert E. Kuenne: Princeton University

Chapter 12 in General Equilibrium Economics, 1992, pp 278-305 from Palgrave Macmillan

Abstract: Abstract In a recent issue of this Journal the author confronted an important set of spatial combinatorial problems of a sequential nature and suggested a method to obtain approximate solutions rather efficiently (Kuenne [4]). In that article the problem is defined formally; its structural resemblances to the transportation, travelling salesman, and weighted set covering problems were discussed, and several examples were solved heuristically. Although existing combinatorial approaches such as branch and bound were mentioned briefly, and a role assigned them in the approximative algorithm, the view was expressed that such paths to exact solution were infeasible computationally.

Keywords: Feasible Solution; Active Node; Node Storage; Primary Node; Good Feasible Solution (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:palchp:978-1-349-12752-8_13

Ordering information: This item can be ordered from
http://www.palgrave.com/9781349127528

DOI: 10.1007/978-1-349-12752-8_13

Access Statistics for this chapter

More chapters in Palgrave Macmillan Books from Palgrave Macmillan
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().