![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 28 matches
- 2006
- Agostinho Agra
, Miguel Fragoso Constantino:
Polyhedral description of the integer single node flow set with constant bounds. Math. Program. 105(2-3): 345-364 (2006) - Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert
:
A branch-and-cut algorithm for multiple sequence alignment. Math. Program. 105(2-3): 387-425 (2006) - Mihai Anitescu
:
Optimization-based simulation of nonsmooth rigid multibody dynamics. Math. Program. 105(1): 113-143 (2006) - Francisco Barahona:
Network reinforcement. Math. Program. 105(2-3): 181-200 (2006) - Daniel Bienstock, Mark Zuckerberg:
Approximate fixed-rank closures of covering problems. Math. Program. 105(1): 9-27 (2006) - Flavia Bonomo
, Guillermo Durán, Min Chih Lin
, Jayme Luiz Szwarcfiter:
On Balanced Graphs. Math. Program. 105(2-3): 233-250 (2006) - Kathie Cameron, Pavol Hell:
Independent packings in structured graphs. Math. Program. 105(2-3): 201-213 (2006) - Michele Conforti, Giacomo Zambelli:
Recognizing Balanceable Matrices. Math. Program. 105(2-3): 161-179 (2006) - Denis Cornaz:
A linear programming formulation for the maximum complete multipartite subgraph problem. Math. Program. 105(2-3): 329-344 (2006) - Richard W. Cottle:
George B. Dantzig: a legendary life in mathematical programming. Math. Program. 105(1): 1-8 (2006) - Sanjeeb Dash, Oktay Günlük
:
Valid inequalities based on simple mixed-integer sets. Math. Program. 105(1): 29-53 (2006) - Ilse Fischer
, Gerald Gruber, Franz Rendl, Renata Sotirov:
Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition. Math. Program. 105(2-3): 451-469 (2006) - Jean Fonlupt, Ali Ridha Mahjoub:
Critical extreme points of the 2-edge connected spanning subgraph polytope. Math. Program. 105(2-3): 289-310 (2006) - Bernard Fortz
, Ali Ridha Mahjoub, S. Thomas McCormick, Pierre Pesneau:
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut. Math. Program. 105(1): 85-111 (2006) - Roberto De Franceschi, Matteo Fischetti, Paolo Toth:
A new ILP-based refinement heuristic for Vehicle Routing Problems. Math. Program. 105(2-3): 471-499 (2006) - J. B. G. Frenk
, Gábor Kassay:
The level set method of Joó and its use in minimax theory. Math. Program. 105(1): 145-155 (2006) - Juan José Salazar González
:
Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data. Math. Program. 105(2-3): 583-603 (2006) - Yongpei Guan, Shabbir Ahmed
, George L. Nemhauser, Andrew J. Miller:
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. Math. Program. 105(1): 55-84 (2006) - Adam N. Letchford
, Juan José Salazar González
:
Projection results for vehicle routing. Math. Program. 105(2-3): 251-274 (2006) - Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey:
Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004. Math. Program. 105(2-3): 157-160 (2006) - Ivana Ljubic
, René Weiskircher, Ulrich Pferschy
, Gunnar W. Klau
, Petra Mutzel
, Matteo Fischetti:
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Math. Program. 105(2-3): 427-449 (2006) - Alexander Martin
, Markus Möller, Susanne Moritz:
Mixed Integer Models for the Stationary Case of Gas Network Optimization. Math. Program. 105(2-3): 563-582 (2006) - Dennis Michaels, Robert Weismantel:
Polyhedra related to integer-convex polynomial systems. Math. Program. 105(2-3): 215-232 (2006) - Dirk Müller:
On the complexity of the planar directed edge-disjoint paths problem. Math. Program. 105(2-3): 275-288 (2006) - Arnaud Pêcher, Annegret Wagler:
Almost all webs are not rank-perfect. Math. Program. 105(2-3): 311-328 (2006) - Rüdiger Schultz, Stephan Tiedemann:
Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse. Math. Program. 105(2-3): 365-386 (2006) - Sergey Shebalov, Diego Klabjan:
Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds. Math. Program. 105(2-3): 523-561 (2006) - Mathieu Van Vyve, Laurence A. Wolsey:
Approximate extended formulations. Math. Program. 105(2-3): 501-522 (2006)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-25 16:01 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