Search results for "4OR"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Francisco Facchinei, Christian Kanzow	Generalized Nash equilibrium problems.	4OR	2007	DBLP DOI BibTeX RDF	MSC classification (2000) 90C30, 91B50, 91A10
1	Ivan Kojadinovic	Quadratic distances for capacity and bi-capacity approximation and identification.	4OR	2007	DBLP DOI BibTeX RDF	MSC Classification 90B50, 90C20, 91B16
1	Adam N. Letchford, Andrea Lodi 0001	The traveling salesman problem: a book review.	4OR	2007	DBLP DOI BibTeX RDF	MSC classification (2000) 90C05, 90C27, 90C57, 90C35
1	Yves De Smet	A multicriteria perspective on reverse auctions.	4OR	2007	DBLP DOI BibTeX RDF	MSC classification 90B50
1	Irène Charon, Olivier Hudry	A survey on the linear ordering problem for weighted or unweighted tournaments.	4OR	2007	DBLP DOI BibTeX RDF	Mathematical Subject Classification (2000) 05C20, 05C90, 06A05, 91F10, 90C27, 68Q17, 68Q25, 90C57, 68R10, 90C10, 90C59, 90C35, 05C38, 06A07
1	Leo Liberti	Compact linearization for binary quadratic problems.	4OR	2007	DBLP DOI BibTeX RDF	MSC classification 90C20, 90C27, 90C11
1	Pietro Belotti, Martine Labbé, Francesco Maffioli, Malick M. Ndiaye	A branch-and-cut method for the obnoxious p -median problem.	4OR	2007	DBLP DOI BibTeX RDF	Obnoxious facility location, Branch-and-cut, p-Median
1	Caroline Prodhon	Solving the capacitated location-routing problem.	4OR	2007	DBLP DOI BibTeX RDF	MSC Classification 90B06
1	Sofie Van Volsem	A method for determining cost-efficient inspection strategies in multistage production systems.	4OR	2007	DBLP DOI BibTeX RDF	MSC Classification 90B25, 90B30
1	Robert N. Boute	Impact of replenishment rules with endogenous lead times on supply chain performance.	4OR	2007	DBLP DOI BibTeX RDF	MSC classification 90B05, 60J20, 90B30
1	Renaud Sirdey	Combinatorial optimization problems in wireless switch design.	4OR	2007	DBLP DOI BibTeX RDF	OR in telecommunications, Combinatorial optimization
1	Alberto Borghetti, Andrea Lodi 0001, Silvano Martello, Michele Martignani, Carlo Alberto Nucci, Alessandro Trebbi	An optimization problem in the electricity market.	4OR	2007	DBLP DOI BibTeX RDF	MSC classification 90C90, 91B74, 90C05, 90B30
1	Genserik L. L. Reniers	Operations research methods in preventing domino accidents in the chemical process industry.	4OR	2007	DBLP DOI BibTeX RDF	MSC Classification (2000) 05A05
1	Cyril Canon	Personnel scheduling in the Call Center industry.	4OR	2007	DBLP DOI BibTeX RDF	MSC classification 90B35, 90B70, 90C11, 90B36
1	Jairo Rafael Montoya-Torres	Internal transport in automated semiconductor manufacturing systems.	4OR	2007	DBLP DOI BibTeX RDF	MSC Classification 90C10, 90B06, 90B80, 90C59
1	Dries R. Goossens	Exact methods for combinatorial auctions.	4OR	2007	DBLP DOI BibTeX RDF	MSC classification (2000) 90C27, 91B26
1	Abdelkader Sbihi, Richard W. Eglese	Combinatorial optimization and Green Logistics.	4OR	2007	DBLP DOI BibTeX RDF	MSC classification (2000) 90C10, 90C90, 90C59, 90C35
1	Fabien Tricoire	Vehicle and personnel routing optimization in the service sector: application to water distribution and treatment.	4OR	2007	DBLP DOI BibTeX RDF	MSC classification 65K05, 90B06, 90C27, 90C35
1	Vincent Hovelaque, L. G. Soler, S. Hafsa	Supply chain organization and e-commerce: a model to analyze store-picking, warehouse-picking and drop-shipping.	4OR	2007	DBLP DOI BibTeX RDF	MSC Classification 90B50
1	Endre Boros, Yves Crama, Bruno Simeone	Peter L. Hammer (1936-2006).	4OR	2007	DBLP DOI BibTeX RDF
1	Matthias Jach, Matthias Köppe, Robert Weismantel	Nondecomposable solutions to group equations and an application to polyhedral combinatorics.	4OR	2006	DBLP DOI BibTeX RDF	Gomory corner polyhedron, irreducible group solutions, simultaneous lifting
1	Jacek Blazewicz, Piotr Lukasiak, Maciej Milostan	Some operations research methods for analyzing protein sequences and structures.	4OR	2006	DBLP DOI BibTeX RDF	clustering, neural networks, dynamic programming, hidden Markov model, Protein structure
1	Tom Van Woensel, Nico Vandaele	Empirical validation of a queueing approach to uninterrupted traffic flows.	4OR	2006	DBLP DOI BibTeX RDF	validation, queueing theory, Traffic flows
1	Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo	Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking.	4OR	2006	DBLP DOI BibTeX RDF	MSC Classification 90B06
1	Maria Elena Bruni	A decomposition-based solution method for stochastic mixed integer nonlinear programs.	4OR	2006	DBLP DOI BibTeX RDF	MSC classification 90C15, 90C11, 49M27
1	Roberto Cordone, Marco Trubian	An exact algorithm for the node weighted Steiner tree problem.	4OR	2006	DBLP DOI BibTeX RDF	Prize collecting, Relax-and-cut, Steiner problem
1	Tom Van Woensel, Bart Wuyts, Nico Vandaele	Validating state-dependent queueing models for uninterrupted traffic flows using simulation.	4OR	2006	DBLP DOI BibTeX RDF	Queueing theory, traffic flows, state dependency
1	Fabrice Tercinet, Emmanuel Néron, Christophe Lenté	Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem.	4OR	2006	DBLP DOI BibTeX RDF	MSC classification 90B35, 90C27
1	Xavier Gandibleux, Frédéric Beugnies, Sabine Randriamasy	Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function.	4OR	2006	DBLP DOI BibTeX RDF	shortest path problem, labelling algorithm, Multi-objective combinatorial optimization
1	Corinne Feremans, Alexander Grigoriev, René Sitters	The geometric generalized minimum spanning tree problem with grid clustering.	4OR	2006	DBLP DOI BibTeX RDF	MSC classification 68Q17, 68W25
1	Frédéric Gardi	Mutual exclusion scheduling with interval graphs or related classes: Complexity and algorithms.	4OR	2006	DBLP DOI BibTeX RDF	Mutual exclusion scheduling, workforce planning, graph classes, graph coloring, interval graphs
1	Matthieu Basseur	Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem.	4OR	2006	DBLP DOI BibTeX RDF	MSC Classification 90C27, 90C29, 90B50
1	Jean-Louis Bouquard, Christophe Lenté	Two-machine flow shop scheduling problems with minimal and maximal delays.	4OR	2006	DBLP DOI BibTeX RDF	branch-and-bound procedure, Flow shop, Max-Plus algebra
1	Michela Milano, Mark Wallace 0001	Integrating operations research in constraint programming.	4OR	2006	DBLP DOI BibTeX RDF	MSC classifications 90C, 68T 68R99, 68T30, 68T27, 68T20
1	Denis Bouyssou, Silvano Martello, Frank Plastria	4OR: Year 4.	4OR	2006	DBLP DOI BibTeX RDF
1	Hassene Aissi	Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems.	4OR	2006	DBLP DOI BibTeX RDF	Min-max regret, Complexity, Combinatorial optimization, Approximation, Data association, Robustness analysis, Min-max
1	Fred W. Glover, César Rego	Ejection chain and filter-and-fan methods in combinatorial optimization.	4OR	2006	DBLP DOI BibTeX RDF	MSC classification 90C59, 90C27, 90C06
1	Katrien Ramaekers, Gerrit K. Janssens, Hendrik Van Landeghem	Towards logistics systems parameter optimisation through the use of response surfaces.	4OR	2006	DBLP DOI BibTeX RDF	Simulation-Optimisation, Regression, Logistics, Experimental design, Response surfaces
1	Marie-Christine Costa, Fethi Jarray, Christophe Picouleau	An acyclic days-off scheduling problem.	4OR	2006	DBLP DOI BibTeX RDF	Workforce scheduling, acyclic scheduling, polynomial time algorithm, maximum flow, discrete tomography
1	K. A. Ariyawansa, Yuntao Zhu	Stochastic semidefinite programming: a new paradigm for stochastic optimization.	4OR	2006	DBLP DOI BibTeX RDF	MSC Classification 90C15, 90C51, 90C05
1	Denis Bouyssou, Silvano Martello, Frank Plastria	A case of plagiarism: Danut Marcu.	4OR	2006	DBLP DOI BibTeX RDF
1	Linda S. Moonen	Algorithms for some graph theoretical optimization problems.	4OR	2006	DBLP DOI BibTeX RDF	MSC classification 05C85
1	Vincent Mousseau, Luis C. Dias, José Rui Figueira	Dealing with inconsistent judgments in multiple criteria sorting models.	4OR	2006	DBLP DOI BibTeX RDF	inconsistency analysis, Multicriteria decision aiding, sorting problem
1	Vincent T'kindt, Karima Bouibede-Hocine, Carl Esswein	Counting and enumeration complexity with application to multicriteria scheduling.	4OR	2005	DBLP DOI BibTeX RDF	complexity, enumeration, counting, Multicriteria scheduling
1	Mikhail A. Kubzin, Vitaly A. Strusevich	Two-machine flow shop no-wait scheduling with machine maintenance.	4OR	2005	DBLP DOI BibTeX RDF	no-wait in process, controllable machine maintenance, approximation scheme, Flow shop scheduling
1	Xavier Delorme	Railroad infrastructure operations : Modeling and resolution.	4OR	2005	DBLP DOI BibTeX RDF	Railroad infrastructure capacity, multiobjective modeling, combinatorial optimization, metaheuristic, GRASP, set packing
1	Zvi Drezner	A distance based rule for removing population members in genetic algorithms.	4OR	2005	DBLP DOI BibTeX RDF	quadratic assignment, Genetic algorithms, tabu search, memetic algorithms
1	Pietro Belotti	Multicommodity network design with survivability constraints: Some models and algorithms.	4OR	2005	DBLP DOI BibTeX RDF	Multi-commodity network flow, network design, branch-and-cut
1	Dorit S. Hochbaum	Complexity and algorithms for convex network optimization and other nonlinear problems.	4OR	2005	DBLP DOI BibTeX RDF	convex network flow, lower bounds on complexity, Nonlinear optimization, strongly polynomial algorithms
1	Manuel Iori	Metaheuristic algorithms for combinatorial optimization problems.	4OR	2005	DBLP DOI BibTeX RDF	Scheduling, Metaheuristics, Transportation, Packing
1	Moncef Abbas, Youcef Saoula	Polynomial algorithms for kernels in comparability, permutation and P4-free graphs.	4OR	2005	DBLP DOI BibTeX RDF	comparability graph, P4-free graph, kernel, Orientation, permutation graph
1	Fethi Jarray	Solving problems of discrete tomography.	4OR	2005	DBLP DOI BibTeX RDF	workforce scheduling, image reconstruction, polynomial time algorithm, maximum flow, Discrete tomography
1	Claude Yugma	Dynamic management of a portfolio of orders.	4OR	2005	DBLP DOI BibTeX RDF	selection of orders, Scheduling, heuristics approaches, exact methods
1	Pasquale Avella, Maurizio Boccia, Carmine Di Martino, Giuseppe Oliviero, Antonio Sforza, Igor Vasil'ev	A decomposition approach for a very large scale optimal diversity management problem.	4OR	2005	DBLP DOI BibTeX RDF	optimal diversity management problem, Lagrangian heuristic, p-median
1	Hartanto Wong	Pooling of repairable spare parts: A study on inventory policies.	4OR	2005	DBLP DOI BibTeX RDF	spare parts, optimization, game theory, pooling, Inventory control
1	Philippe Galinier, Michel Gendreau, Patrick Soriano, Serge Bisaillon	Solving the frequency assignment problem with polarization by local search and tabu.	4OR	2005	DBLP DOI BibTeX RDF	tabu search, metaheuristics, Frequency Assignment Problem
1	Natalia V. Shakhlevich	Open shop unit-time scheduling problems with symmetric objective functions.	4OR	2005	DBLP DOI BibTeX RDF	Open shop scheduling, symmetric function, parallel machine scheduling
1	Hafida Essaqote, Noureddine Zahid, Mohamed Limouri, Abderrahmane Essaid	A new approach for unsupervised classification.	4OR	2005	DBLP DOI BibTeX RDF	unidimensional histograms, concave segment, mode detection, Unsupervised classification
1	Edmond J. Vanderperre, Stanislav S. Makhanov	A Markov time related to a robot-safety device system.	4OR	2005	DBLP DOI BibTeX RDF	safety device, cold standby, recovery time, Weibull repair, Robot, availability
1	Roberto Montemanni, Luca Maria Gambardella	The robust shortest path problem with interval data via Benders decomposition.	4OR	2005	DBLP DOI BibTeX RDF	robust optimization, Shortest path problem, Benders decomposition, interval data
1	Dominique de Werra, Pierre Hansen	Variations on the Roy-Gallai theorem.	4OR	2005	DBLP DOI BibTeX RDF	panchromatic chains, stable sets, Graph coloring, chromatic number, longest path
1	Annegret Wagler	On rank-perfect subclasses of near-bipartite graphs.	4OR	2005	DBLP DOI BibTeX RDF	Stable set polytope, antiwebs, rank constraints
1	Denis Bouyssou, Silvano Martello, Frank Plastria	Acknowledgement to referees.	4OR	2005	DBLP DOI BibTeX RDF
1	Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint	Sensitivity of trust-region algorithms to their parameters.	4OR	2005	DBLP DOI BibTeX RDF	Unconstrained programming, algorithmic parameters, trust-region methods
1	Cyriel Van Nuffelen, Kristel Van Rompay	On the length of longest chordless cycles.	4OR	2005	DBLP DOI BibTeX RDF	rank, eigenvalues, cycle, Adjacency matrix
1	Alain Hertz, David Schindl, Nicolas Zufferey	Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints.	4OR	2005	DBLP DOI BibTeX RDF	lower bounds, tabu search, Frequency Assignment Problems
1	Benoît Colson, Patrice Marcotte, Gilles Savard	Bilevel programming: A survey.	4OR	2005	DBLP DOI BibTeX RDF	Optimal pricing, Nonlinear programming, Bilevel programming, Mathematical programs with equilibrium constraints
1	Julia Pahl, Stefan Voß 0001, David L. Woodruff	Production planning with load dependent lead times.	4OR	2005	DBLP DOI BibTeX RDF	load dependent lead times, supply chain management, mathematical programming, Production planning
1	Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky	Ten notes on equal-processing-time scheduling.	4OR	2004	DBLP DOI BibTeX RDF	Scheduling, computational complexity, polynomial time
1	Mustafa Ç. Pinar	A note on robust 0-1 optimization with uncertain cost coefficients.	4OR	2004	DBLP DOI BibTeX RDF	0-1 optimization, uncertain cost coefficients, Robust optimization
1	Silvano Martello	Stefano Pallottino (1945-2004).	4OR	2004	DBLP DOI BibTeX RDF
1	Thierry Benoist, Benoît Rottembourg	Upper bounds for revenue maximization in a satellite scheduling problem.	4OR	2004	DBLP DOI BibTeX RDF	concave costs, Russian Dolls, Upper bounds, valid inequalities
1	Roel Leus	The generation of stable project plans.	4OR	2004	DBLP DOI BibTeX RDF	multi-project organisations, robustness, uncertainty, Project scheduling
1	Olivier Spanjaard	Non-classical preference models in combinatorial problems: Models and algorithms for graphs.	4OR	2004	DBLP DOI BibTeX RDF	combinatorial optimization, graphs, heuristic search, preference modelling, Decision aiding
1	Robert D. Carr, Giuseppe Lancia	Compact optimization can outperform separation: A case study in structural proteomics.	4OR	2004	DBLP DOI BibTeX RDF	compact optimization, subtour-elimination, Linear programming, contact map
1	Jakob Krarup, Malene Nordlund Rørbech	LP formulations of the shortest path tree problem.	4OR	2004	DBLP DOI BibTeX RDF	visualizing LP-duality, linear programming, Shortest paths
1	Bruno Bachelet, Philippe Mahey	Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs.	4OR	2004	DBLP DOI BibTeX RDF	Minimum cost tension, two-terminal series-parallel digraph, series-parallel recognition, out-of-kilter algorithm, graph decomposition
1	Mathieu Van Vyve	A solution approach of production planning problems based on compact formulations for single-item lot-sizing models.	4OR	2004	DBLP DOI BibTeX RDF
1	Raymond Bisdorff	Concordant outranking with multiple criteria of ordinal significance.	4OR	2004	DBLP DOI BibTeX RDF	outranking methods, concordance approach, ordinal significance of criteria, Multicriteria decision aid
1	Jean-Pierre Barthélemy, François Brucker, Christophe Osswald	Combinatorial optimization and hierarchical classifications.	4OR	2004	DBLP DOI BibTeX RDF	quasi-hierarchies, rigid hypergraphs, subdominant, complexity, clustering algorithms, Hierarchical classification
1	Jawad Abrache, Teodor Gabriel Crainic, Michel Gendreau	Design issues for combinatorial auctions.	4OR	2004	DBLP DOI BibTeX RDF	bidding languages, iterative auctions, E-commerce, mechanism design, combinatorial auctions, advisors
1	Giorgio Fasano	A MIP approach for some practical packing problems: Balancing constraints and tetris-like items.	4OR	2004	DBLP DOI BibTeX RDF	balancing conditions, tetris-like items, MIP-based heuristic approach, mixed integer programming, Packing
1	Benoît Colson	Trust-region algorithms for derivative-free optimization and nonlinear bilevel programming.	4OR	2004	DBLP DOI BibTeX RDF	software, bilevel programming, Trust-region methods, multivariate interpolation, derivative-free optimization
1	Hande Yaman	Concentrator location in telecommunications.	4OR	2004	DBLP DOI BibTeX RDF	Concentrator location, polyhedral theory, branch and cut
1	Leo Liberti	Reformulation and convex relaxation techniques for global optimization.	4OR	2004	DBLP DOI BibTeX RDF	bilinear problem, Global optimization, reformulation
1	Yurij Stoyan, Guntram Scheithauer, Nikolay Gil, Tatiana E. Romanova	Phi-functions for complex 2D-objects.	4OR	2004	DBLP DOI BibTeX RDF	2D placement problems, optimization, mathematical modelling, Cutting and packing
1	Patrizia Beraldi, Domenico Conforti, Chefi Triki, Antonio Violi	Constrained auction clearing in the Italian electricity market.	4OR	2004	DBLP DOI BibTeX RDF	auction clearing, optimization models, Electricity market
1	Jean François Maurras, Sonia Vanier	Network synthesis under survivability constraints.	4OR	2004	DBLP DOI BibTeX RDF	Survivable telecommunication networks, routing, complexity, multicommodity flows
1	Emilie Danna	Integrating local search techniques into mixed integer programming.	4OR	2004	DBLP DOI BibTeX RDF	scheduling, local search, Mixed integer programming, hybrid algorithms, vehicle routing, branch-and-price
1	Annegret Wagler	Antiwebs are rank-perfect.	4OR	2004	DBLP DOI BibTeX RDF	Stable set polytope, antiwebs, rank constraints
1	Marc Sevaux, Kenneth Sörensen	A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates.	4OR	2004	DBLP DOI BibTeX RDF	Quality robustness, solution robustness, weighted number of late jobs, genetic algorithm, single machine scheduling
1	Jean-Pierre Brans, Giorgio Gallo	Ethics in OR/MS: Past, present and future.	4OR	2004	DBLP DOI BibTeX RDF	Societal problem analysis, social implications of operations research practice, ethics
1	Alberto Caprara	Knapsack problems: A book review.	4OR	2004	DBLP DOI BibTeX RDF	applications, Knapsack problem, exact algorithm, approximation scheme
1	Michelangelo Conforti, Romeo Rizzi	Combinatorial optimization - Polyhedra and efficiency: A book review.	4OR	2004	DBLP DOI BibTeX RDF	Combinatorial optimization, integer programming, polyhedral combinatorics
1	Denis Bouyssou, Silvano Martello, Frank Plastria	Acknowledgement to referees.	4OR	2003	DBLP DOI BibTeX RDF
1	Marco A. Boschetti, Aristide Mingozzi	The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds.	4OR	2003	DBLP DOI BibTeX RDF	Lower Bounds, Heuristic Algorithms, Cutting and Packing
1	Claude Lemaréchal	The omnipresence of Lagrange.	4OR	2003	DBLP DOI BibTeX RDF	combinatorial optimization, duality, column generation, Lagrange relaxation
1	Karen I. Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano	Models and solution techniques for frequency assignment problems.	4OR	2003	DBLP DOI BibTeX RDF	models, heuristics, channel assignment, Frequency assignment, exact methods
1	Alberto Ceselli	Two exact algorithms for the capacitated p-median problem.	4OR	2003	DBLP DOI BibTeX RDF	branch and bound, column generation, Lagrangean relaxation, Location theory
1	Cyriel Van Nuffelen, Kristel Van Rompay	Upper bounds on the independence and the clique covering number.	4OR	2003	DBLP DOI BibTeX RDF	clique covering number, eigenvalues, adjacency matrix, independence number

Publications at "4OR"( http://dblp.L3S.de/Venues/4OR )