Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 42 matches
- 2012
- Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo:
Layered Formulation for the Robust Vehicle Routing Problem with Time Windows. ISCO 2012: 249-260 - Eduardo Álvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt:
Models and Algorithms for Robust Network Design with Several Traffic Scenarios. ISCO 2012: 261-272 - Gabriela R. Argiroffo, Graciela L. Nasini, Pablo Daniel Torres:
The Packing Coloring Problem for (q, q-4) Graphs. ISCO 2012: 309-319 - Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientations Optimizing the Number of Light or Heavy Vertices. ISCO 2012: 332-343 - Giorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco:
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs. ISCO 2012: 1-14 - Pierre Bonami, Viet Hung Nguyen, Michel Klein, Michel Minoux:
On the Solution of a Graph Partitioning Problem under Capacity Constraints. ISCO 2012: 285-296 - Sylvie Borne, Roland Grappe, Mathieu Lacroix:
The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks. ISCO 2012: 105-116 - Gábor Braun, Sebastian Pokutta:
An Algebraic Approach to Symmetric Extended Formulations. ISCO 2012: 141-152 - Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Models and Algorithms for the Train Unit Assignment Problem. ISCO 2012: 24-35 - Jianqiang Cheng, Céline Gicquel, Abdel Lisser:
A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs. ISCO 2012: 71-80 - Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries:
Selective Graph Coloring in Some Special Classes of Graphs. ISCO 2012: 320-331 - Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma:
Fast Separation Algorithms for Three-Index Assignment Problems. ISCO 2012: 189-200 - Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary:
Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols. ISCO 2012: 129-140 - Tommy Färnqvist:
Counting Homomorphisms via Hypergraph-Based Structural Restrictions. ISCO 2012: 380-391 - Cristina G. Fernandes, Rafael Crivellari Saliba Schouery:
Second-Price Ad Auctions with Binary Bids and Markets with Good Competition. ISCO 2012: 439-450 - Matteo Fischetti, Leo Liberti:
Orbital Shrinking. ISCO 2012: 48-58 - Pierre Fouilhoux, Aurélien Questel:
The Non-Disjoint m-Ring-Star Problem: Polyhedral Results and SDH/SONET Network Design. ISCO 2012: 93-104 - Alexandre S. Freire, Vicente Acuña, Pilu Crescenzi, Carlos Eduardo Ferreira, Vincent Lacroix, Paulo Vieira Milreu, Eduardo Moreno, Marie-France Sagot:
Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone. ISCO 2012: 165-177 - Satoru Fujishige, Jens Maßberg:
Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes. ISCO 2012: 153-164 - Fabio Furini, Carlo Alfredo Persiani, Paolo Toth:
Aircraft Sequencing Problems via a Rolling Horizon Algorithm. ISCO 2012: 273-284 - Laura Galli, Konstantinos Kaparis, Adam N. Letchford:
Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm. ISCO 2012: 178-188 - Agnès Gorge, Abdel Lisser, Riadh Zorgati:
Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program. ISCO 2012: 81-92 - Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic:
On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes. ISCO 2012: 201-212 - Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh:
Branch-and-Price Guided Search - (Extended Abstract). ISCO 2012: 15-18 - Anna Huber, Vladimir Kolmogorov:
Towards Minimizing k-Submodular Functions. ISCO 2012: 451-462 - Mikhail Y. Kovalyov, Ammar Oulamara, Ameur Soukhal:
Two-Agent Scheduling on an Unbounded Serial Batching Machine. ISCO 2012: 427-438 - Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin:
Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem. ISCO 2012: 117-128 - Monique Laurent, Antonios Varvitsiotis:
The Gram Dimension of a Graph. ISCO 2012: 356-367 - Leonardo Conegundes Martinez, Alexandre Salles da Cunha:
A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem. ISCO 2012: 237-248 - Monaldo Mastrolilli, Georgios Stamoulis:
Constrained Matching Problems in Bipartite Graphs. ISCO 2012: 344-355
skipping 12 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-17 22:49 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint