


default search action
Discrete Optimization, Volume 26
Volume 26, November 2017
- Manish Bansal

, Kiavash Kianfar
:
Facets for continuous multi-mixing set with general coefficients and bounded integer variables. 1-25 - Kenjiro Takazawa

:
Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs. 26-40 - Ruo-Wei Hung

, Chin-Feng Li, Jong-Shin Chen, Qing-SongSu:
The Hamiltonian connectivity of rectangular supergrid graphs. 41-65 - Bostjan Bresar, Csilla Bujtás

, Tanja Gologranc, Sandi Klavzar
, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Grundy dominating sequences and zero forcing sets. 66-77 - Shun Fukuda, Akiyoshi Shioura, Takeshi Tokuyama

:
Buyback problem with discrete concave valuation functions. 78-96 - Jamie Fairbrother

, Adam N. Letchford
:
Projection results for the -partition problem. 97-111 - Zakir Deniz

, Tínaz Ekim
, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom
:
On two extensions of equimatchable graphs. 112-130 - Kevin Balas, Adrian Dumitrescu

, Csaba D. Tóth:
Anchored rectangle and square packings. 131-162 - Brad D. Woods, Abraham P. Punnen, Tamon Stephen:

A linear time algorithm for the -neighbour Travelling Salesman Problem on a Halin graph and extensions. 163-182 - Takuro Fukunaga

, Shuichi Hirahara, Hiyori Yoshikawa:
Virtual machine placement for minimizing connection cost in data center networks. 183-198

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














