Остановите войну!
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 25 matches
- 2002
- Miguel F. Anjos, Henry Wolkowicz:
Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks. J. Comb. Optim. 6(3): 237-270 (2002) - Laleh Behjat, Dorothy Kucar, Anthony Vannelli:
A Novel Eigenvector Technique for Large Scale Combinatorial Problems in VLSI Layout. J. Comb. Optim. 6(3): 271-286 (2002) - Fatiha Bendali, Ali Ridha Mahjoub, Jean Mailfert:
Composition of Graphs and the Triangle-Free Subgraph Polytope. J. Comb. Optim. 6(4): 359-381 (2002) - Stanislav Busygin, Sergiy Butenko, Panos M. Pardalos:
A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere. J. Comb. Optim. 6(3): 287-297 (2002) - Gruia Calinescu, Peng-Jun Wan:
Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs. J. Comb. Optim. 6(4): 425-453 (2002) - Alberto Caprara, Romeo Rizzi:
Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals. J. Comb. Optim. 6(2): 157-182 (2002) - Hsun-Wen Chang, Rong-Jaye Chen, Frank K. Hwang:
The Structural Birnbaum Importance of Consecutive-k Systems. J. Comb. Optim. 6(2): 183-197 (2002) - Shi Ping Chen, Yong He, Guo-Hui Lin:
3-Partitioning Problems for Maximizing the Minimum Load. J. Comb. Optim. 6(1): 67-80 (2002) - Xiaotie Deng, Guojun Li, Lusheng Wang:
Center and Distinguisher for Strings with Unbounded Alphabet. J. Comb. Optim. 6(4): 383-400 (2002) - M. Ericsson, Mauricio G. C. Resende, Panos M. Pardalos:
A Genetic Algorithm for the Weight Setting Problem in OSPF Routing. J. Comb. Optim. 6(3): 299-333 (2002) - Xiaodong Gu, Guoliang Chen, Jun Gu, Liusheng Huang, Yunjae Jung:
Performance Analysis and Improvement for Some Linear On-Line Bin-Packing Algorithms. J. Comb. Optim. 6(4): 455-471 (2002) - Saïd Hanafi, Fred W. Glover:
Resolution Search and Dynamic Branch-and-Bound. J. Comb. Optim. 6(4): 401-423 (2002) - Yong He, Zhiyi Tan:
Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time. J. Comb. Optim. 6(2): 199-206 (2002) - Mhand Hifi, Slim Sadfi:
The Knapsack Sharing Problem: An Exact Algorithm. J. Comb. Optim. 6(1): 35-54 (2002) - J. C. James, Saïd Salhi:
A Tabu Search Heuristic for the Location of Multi-Type Protection Devices on Electrical Supply Tree Networks. J. Comb. Optim. 6(1): 81-98 (2002) - Michael Krivelevich, Van H. Vu:
Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time. J. Comb. Optim. 6(2): 143-155 (2002) - Jon Lee:
All-Different Polytopes. J. Comb. Optim. 6(3): 335-352 (2002) - Hans van Maaren, Chuangyin Dang:
Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs. J. Comb. Optim. 6(2): 133-142 (2002) - Panos M. Pardalos, Henry Wolkowicz:
Preface. J. Comb. Optim. 6(3): 235-236 (2002) - Marcus Randall, Graham McMahon, Stephen Sugden:
A Simulated Annealing Approach to Communication Network Design. J. Comb. Optim. 6(1): 55-65 (2002) - Jie Sun, Y. Gu:
A Parametric Approach for a Nonlinear Discrete Location Problem. J. Comb. Optim. 6(2): 119-132 (2002) - Alfred Wassermann:
Attacking the Market Split Problem with Lattice Point Enumeration. J. Comb. Optim. 6(1): 5-16 (2002) - Jian Yang, Gang Yu:
On the Robust Single Machine Scheduling Problem. J. Comb. Optim. 6(1): 17-33 (2002) - Jianzhong Zhang, Zhenhong Liu:
A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l-Norm. J. Comb. Optim. 6(2): 207-227 (2002) - Binhai Zhu, Zhongping Qin:
New Approximation Algorithms for Map Labeling with Sliding Labels. J. Comb. Optim. 6(1): 99-110 (2002)
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-25 10:32 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