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
- 2013
- Mahuna Akplogan, Simon de Givry, Jean-Philippe Métivier, Gauthier Quesnel, Alexandre Joannon, Frédérick Garçia:
Solving the Crop Allocation Problem using Hard and Soft Constraints. RAIRO Oper. Res. 47(2): 151-172 (2013) - Alireza Amirteimoori, Behrooz Daneshian, Sohrab Kordrostami, Kambiz Shahroodi:
Production planning in data envelopment analysis without explicit inputs. RAIRO Oper. Res. 47(3): 273-284 (2013) - Cyril Briand, Samia Ourari:
Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds. RAIRO Oper. Res. 47(1): 33-46 (2013) - Samuel Deleplanque, Safia Kedad-Sidhoum, Alain Quilliot:
Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities. RAIRO Oper. Res. 47(4): 429-443 (2013) - François Fages, Simon de Givry, Christine Solnon:
Preface. RAIRO Oper. Res. 47(2): 89-90 (2013) - Mathieu Fontaine, Samir Loudni, Patrice Boizumault:
Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS. RAIRO Oper. Res. 47(2): 91-123 (2013) - Haris Gavranovic, Mirsad Buljubasic:
A Hybrid Approach Combining Local Search and Constraint Programming for a Large Scale Energy Management Problem. RAIRO Oper. Res. 47(4): 481-500 (2013) - Carmen Gervet, Mohammad Atef:
Optimal Allocation of Renewable Energy Parks: A Two-stage Optimization Model. RAIRO Oper. Res. 47(2): 125-150 (2013) - Christelle Guéret, Eric Pinson, David Rivreau:
Combinatorial optimization in production and logistics systems. RAIRO Oper. Res. 47(4): 395-397 (2013) - Yuhan Guo, Gilles Goncalves, Tienté Hsu:
A multi-destination daily carpooling problem and an ant colony based resolution method. RAIRO Oper. Res. 47(4): 399-428 (2013) - Cheng He, Xiumei Wang, Yixun Lin, Yundong Mu:
An Improved Algorithm for a Bicriteria Batching Scheduling Problem. RAIRO Oper. Res. 47(1): 1-8 (2013) - Jean-Baptiste Hiriart-Urruty, Hai Yen Le:
From Eckart and Young approximation to Moreau envelopes and vice versa. RAIRO Oper. Res. 47(3): 299-310 (2013) - Stefan Janaqi, Jorge Aguilera, Mériam Chèbre:
Robust real-time optimization for the linear oil blending. RAIRO Oper. Res. 47(4): 465-479 (2013) - Reza Keykhaei, Mohamad Taghi Jahandideh:
Producing the tangency portfolio as a corner portfolio. RAIRO Oper. Res. 47(3): 311-320 (2013) - Alix Munier Kordon, Fadi Kacem, Benoît Dupont de Dinechin, Lucian Finta:
Scheduling an interval ordered precedence graph with communication delays and a limited number of processors. RAIRO Oper. Res. 47(1): 73-87 (2013) - Victoria L. Kreps, Victor K. Domansky:
Repeated games with asymmetric information modeling financial markets with two risky assets. RAIRO Oper. Res. 47(3): 251-272 (2013) - Muthukrishnan Senthil Kumar, R. Arumuganathan:
An MX/G/1 unreliable retrial queue with two phase service and persistence behaviour of customers in service. RAIRO Oper. Res. 47(1): 9-32 (2013) - Christian Laforest, Raksmey Phan:
Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic. RAIRO Oper. Res. 47(3): 199-221 (2013) - Ningombam Sanjib Meitei, Snigdha Banerjee:
Newsboy Problem: Viability of Optimal Initial Selling Price and Ordering Policies in the Presence of Exogenous Price Decline and Random Lead Time. RAIRO Oper. Res. 47(4): 371-394 (2013) - Frédéric Meunier:
Computing and proving with pivots. RAIRO Oper. Res. 47(4): 331-360 (2013) - Hashem Saberi Najafi, S. A. Edalatpanah:
Iterative methods with analytical preconditioning technique to linear complementarity problems: application to obstacle problems. RAIRO Oper. Res. 47(1): 59-71 (2013) - Maxime Ogier, Van-Dat Cung, Julien Boissière:
Service network design in short and local fresh food supply chain. RAIRO Oper. Res. 47(4): 445-464 (2013) - Cédric Pralet, Gérard Verfaillie:
Time-dependent Simple Temporal Networks: Properties and Algorithms. RAIRO Oper. Res. 47(2): 173-198 (2013) - Sylvain Sorin, Cheng Wan:
Delegation equilibrium payoffs in integer-splitting games. RAIRO Oper. Res. 47(1): 47-58 (2013) - Luis Miguel Torres, Annegret Katrin Wagler:
Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view. RAIRO Oper. Res. 47(3): 321-330 (2013) - Sid Ahmed Ali Touati, Sébastien Briais, Karine Deschinkel:
How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations. RAIRO Oper. Res. 47(3): 223-249 (2013) - Yong Xia:
New results on semidefinite bounds for ℓ1-constrained nonconvex quadratic optimization. RAIRO Oper. Res. 47(3): 285-297 (2013) - Qingjian Zhou, Jia Jiao, Datian Niu, Deli Yang:
Decision-making of portfolio investment with linear plus double exponential utility function. RAIRO Oper. Res. 47(4): 361-370 (2013)
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-10-03 01:41 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