Остановите войну!
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 26 matches
- 2009
- Mathieu Bouchard, Alain Hertz, Guy Desaulniers:
Lower bounds and a tabu search algorithm for the minimum deficiency problem. J. Comb. Optim. 17(2): 168-191 (2009) - Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos:
Probabilistic graph-coloring in bipartite and split graphs. J. Comb. Optim. 17(3): 274-311 (2009) - Niranjan Chakravarthy, Shivkumar Sabesan, Kostas Tsakalis, Leonidas D. Iasemidis:
Controlling epileptic seizures in a neural mass model. J. Comb. Optim. 17(1): 98-116 (2009) - Saman Eskandarzadeh, Reza Tavakkoli-Moghaddam, Amir Azaron:
An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems. J. Comb. Optim. 17(2): 214-234 (2009) - Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer:
Single machine batch scheduling with release times. J. Comb. Optim. 17(3): 323-338 (2009) - Imed Kacem:
Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. J. Comb. Optim. 17(2): 117-133 (2009) - Tz-Liang Kueng, Cheng-Kuan Lin, Tyne Liang, Jimmy J. M. Tan, Lih-Hsing Hsu:
A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges. J. Comb. Optim. 17(3): 312-322 (2009) - Yannis Marinakis, Athanasios Migdalas, Panos M. Pardalos:
Multiple phase neighborhood Search - GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP. J. Comb. Optim. 17(2): 134-156 (2009) - Lopamudra Mukherjee, Vikas Singh, Jiming Peng, Jinhui Xu, Michael J. Zeitz, Ronald Berezney:
Generalized median graphs and applications. J. Comb. Optim. 17(1): 21-44 (2009) - Dominique Quadri, Éric Soutif, Pierre Tolla:
Exact solution method to solve large scale integer quadratic multidimensional knapsack problems. J. Comb. Optim. 17(2): 157-167 (2009) - Shivkumar Sabesan, Niranjan Chakravarthy, Kostas Tsakalis, Panos M. Pardalos, Leonidas D. Iasemidis:
Measuring resetting of brain dynamics at epileptic seizures: application of global optimization and spatial synchronization techniques. J. Comb. Optim. 17(1): 74-97 (2009) - Subhash C. Sarin, Balaji Nagarajan, Sanjay Jain, Lingrui Liao:
Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability. J. Comb. Optim. 17(4): 400-416 (2009) - Onur Seref, O. Erhun Kundakcioglu, Oleg A. Prokopyev, Panos M. Pardalos:
Selective support vector machines. J. Comb. Optim. 17(1): 3-20 (2009) - Onur Seref, Petros Xanthopoulos:
Guest Editorial. J. Comb. Optim. 17(1): 1-2 (2009) - C. L. Stabler, Christopher Fraker, E. Pedraza, I. Constantinidis, A. Sambanis:
Modeling and in vitro and in vivo characterization of a tissue engineered pancreatic substitute. J. Comb. Optim. 17(1): 54-73 (2009) - My T. Thai, Taieb Znati:
On the complexity and approximation of non-unique probe selection using d -disjunct matrix. J. Comb. Optim. 17(1): 45-53 (2009) - Natalia Vanetik:
Path packing and a related optimization problem. J. Comb. Optim. 17(2): 192-205 (2009) - Jianping Wang, Jing Chen, Mei Yang, S. Q. Zheng:
Traffic regulation with single- and dual-homed ISPs under a percentile-based pricing policy. J. Comb. Optim. 17(3): 247-273 (2009) - Zhenbo Wang, Wenxun Xing:
A successive approximation algorithm for the multiple knapsack problem. J. Comb. Optim. 17(4): 347-366 (2009) - Peng Xiao, Yinfeng Xu, Bing Su:
Finding an anti-risk path between two nodes in undirected graphs. J. Comb. Optim. 17(3): 235-246 (2009) - Guang Xu, Jinhui Xu:
An improved approximation algorithm for uncapacitated facility location problem with penalties. J. Comb. Optim. 17(4): 424-436 (2009) - Boting Yang, Yi Cao:
Standard directed search strategies and their applications. J. Comb. Optim. 17(4): 378-399 (2009) - Deshi Ye, Xin Han, Guochuan Zhang:
A note on online strip packing. J. Comb. Optim. 17(4): 417-423 (2009) - Jinjiang Yuan, Shisheng Li, Ji Tian, Ruyan Fu:
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times. J. Comb. Optim. 17(2): 206-213 (2009) - Xinlu Zhang, Jun Guo, Suogang Gao:
Two new error-correcting pooling designs from d -bounded distance-regular graphs. J. Comb. Optim. 17(3): 339-345 (2009) - Huaming Zhang, Xin He:
Optimal st -orientations for plane triangulations. J. Comb. Optim. 17(4): 367-377 (2009)
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-26 14:04 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