Volume 29, Issue 3, October 2012

Special Issue on Discrete Structure and Optimization

ISSN: 0916-7005 (Print) 1868-937X (Online)

In this issue (14 articles)

  1. No Access

    Editorial

    Preface to the special issue on discrete structure and optimization

    Kazuo Murota, Hisashi Okamoto Pages 355-356
    Get Access

  2. No Access

    Original Paper

    Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested

    Satoru Fujishige Pages 357-384
    Look Inside Get Access

  3. No Access

    Original Paper

    Computation of the Shapley value of minimum cost spanning tree games: #P-hardness and polynomial cases

    Kazutoshi Ando Pages 385-400
    Look Inside Get Access

  4. No Access

    Original Paper

    Matching with partially ordered contracts

    Rashid Farooq, Tamás Fleiner, Akihisa Tamura Pages 401-417
    Look Inside Get Access

  5. No Access

    Original Paper

    Simple push-relabel algorithms for matroids and submodular flows

    András Frank, Zoltán Miklós Pages 419-439
    Look Inside Get Access

  6. No Access

    Original Paper

    Lattice polyhedra and submodular flows

    Satoru Fujishige, Britta Peis Pages 441-451
    Look Inside Get Access

  7. No Access

    Original Paper

    Computational geometric approach to submodular function minimization for multiclass queueing systems

    Toshinari Itoko, Satoru Iwata Pages 453-468
    Look Inside Get Access

  8. No Access

    Original Paper

    Computing knapsack solutions with cardinality robustness

    Naonori Kakimura, Kazuhisa Makino… Pages 469-483
    Look Inside Get Access

  9. No Access

    Original Paper

    Robustness of minimum cost arborescences

    Naoyuki Kamiyama Pages 485-497
    Look Inside Get Access

  10. No Access

    Original Paper

    A primal barrier function Phase I algorithm for nonsymmetric conic optimization problems

    Yasuaki Matsukawa, Akiko Yoshise Pages 499-517
    Look Inside Get Access

  11. No Access

    Original Paper

    Equivalence of convex minimization problems over base polytopes

    Kiyohito Nagano, Kazuyuki Aihara Pages 519-534
    Look Inside Get Access

  12. No Access

    Original Paper

    Matroid rank functions and discrete concavity

    Akiyoshi Shioura Pages 535-546
    Look Inside Get Access

  13. No Access

    Original Paper

    Preference profiles determining the proposals in the Gale–Shapley algorithm for stable matching problems

    Noriyoshi Sukegawa, Yoshitsugu Yamamoto Pages 547-560
    Look Inside Get Access

  14. No Access

    Original Paper

    Shortest bibranchings and valuated matroid intersection

    Kenjiro Takazawa Pages 561-573
    Look Inside Get Access