Yves Crama

Orcid: 0000-0002-7470-4743

Affiliations:
  • University of Liège , Belgium


According to our database1, Yves Crama authored at least 94 papers between 1986 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
21 volumes for the 21st century.
4OR, March, 2024

Multi-period distribution networks with purchase commitment contracts.
Eur. J. Oper. Res., January, 2024

2023
Cycle selections.
Discret. Appl. Math., August, 2023

2022
Recourse in Kidney Exchange Programs.
INFORMS J. Comput., 2022

Sixty-one surveys in operations research.
Ann. Oper. Res., 2022

Quadratic reformulations for the optimization of pseudo-boolean functions.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

2021
4OR comes of age.
4OR, 2021

2020
Compact quadratizations for pseudo-Boolean functions.
J. Comb. Optim., 2020

Recovery management for a dial-a-ride system with real-time disruptions.
Eur. J. Oper. Res., 2020

2019
Adaptive Large Neighborhood Search for Multitrip Vehicle Routing with Time Windows.
Transp. Sci., 2019

Do balanced words have a short period?
Theor. Comput. Sci., 2019

Vehicle allocation problem with uncertain transportation requests over a multi-period rolling horizon.
Logist. Res., 2019

Revealed preference theory: An algorithmic outlook.
Eur. J. Oper. Res., 2019

Berge-acyclic multilinear 0-1 optimization problems.
Eur. J. Oper. Res., 2019

Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016.
Discret. Appl. Math., 2019

2018
Stochastic Inventory Routing for Perishable Products.
Transp. Sci., 2018

Surveys in operations research.
Ann. Oper. Res., 2018

Preface.
Ann. Oper. Res., 2018

Sweet sixteen.
4OR, 2018

Quadratizations of symmetric pseudo-Boolean functions: sub-linear bounds on the number of auxiliary variables.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

2017
Special issue: Twelfth Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015).
J. Sched., 2017

Quadratic reformulations of nonlinear binary optimization problems.
Math. Program., 2017

A class of valid inequalities for multilinear 0-1 optimization problems.
Discret. Optim., 2017

2016
Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms.
Oper. Res., 2016

Large neighborhood search for multi-trip vehicle routing.
Eur. J. Oper. Res., 2016

Quadratization of symmetric pseudo-Boolean functions.
Discret. Appl. Math., 2016

A brand new cheating attempt: a case of usurped identity.
4OR, 2016

2014
Multi-period vehicle loading with stochastic release dates.
EURO J. Transp. Logist., 2014

Multi-dimensional vector assignment problems.
Discret. Optim., 2014

2013
Power Indices and the Measurement of Control in Corporate Structures.
IGTR, 2013

Boolean Functions.
Discret. Appl. Math., 2013

2011
The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models.
Ann. Oper. Res., 2011

Logical analysis of data: classification with justification.
Ann. Oper. Res., 2011

Control and voting power in complex shareholding networks.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Boolean Functions - Theory, Algorithms, and Applications.
Encyclopedia of mathematics and its applications 142, Cambridge University Press, ISBN: 978-0-521-84751-3, 2011

2010
Throughput optimization in two-machine flowshops with flexible operations.
J. Sched., 2010

Optimal selection of a portfolio of options under Value-at-Risk constraints: a scenario approach.
Ann. Oper. Res., 2010

Space and time allocation in a shipyard assembly hall.
Ann. Oper. Res., 2010

Synthesis of Multilevel Boolean Networks.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Proof Theory.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Learning Boolean Functions with Queries.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Compositions and Clones of Boolean Functions.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Hardware Equivalence and Property Verification.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Optimization Methods in Logic.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Probabilistic Analysis of Satisfiability Algorithms.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Boolean Aspects of Network Reliability.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Vectorial Boolean Functions for Cryptography.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Boolean Functions for Cryptography and Error-Correcting Codes.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Fourier Transforms and Threshold Circuit Complexity.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Binary Decision Diagrams.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Decomposition of Boolean Functions.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Decision Lists and Related Classes of Boolean Functions.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Neural Networks and Boolean Functions.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Probabilistic Learning and Boolean Functions.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

Circuit Complexity.
Proceedings of the Boolean Models and Methods in Mathematics, 2010

2008
Counting and enumerating aggregate classifiers.
Discret. Appl. Math., 2008

2007
The tool switching problem revisited.
Eur. J. Oper. Res., 2007

Control and voting power in corporate networks: Concepts and computational aspects.
Eur. J. Oper. Res., 2007

Obituary Peter L. Hammer (1936-2006).
Bull. EATCS, 2007

Peter Ladislaw Hammer.
Discret. Math., 2007

Peter Ladislaw Hammer: December 23, 1936-December 27, 2006.
Discret. Optim., 2007

Peter L. Hammer (1936-2006).
4OR, 2007

2005
A Framework for the Complexity of High-Multiplicity Scheduling Problems.
J. Comb. Optim., 2005

2004
Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes.
Eur. J. Oper. Res., 2004

The maximum deviation just-in-time scheduling problem.
Discret. Appl. Math., 2004

Consensus algorithms for the generation of all maximal bicliques.
Discret. Appl. Math., 2004

2003
Approximation algorithms for the design of SDH/SONET networks.
RAIRO Oper. Res., 2003

Simulated annealing for complex portfolio selection problems.
Eur. J. Oper. Res., 2003

2002
Production planning problems in printed circuit board assembly.
Discret. Appl. Math., 2002

2000
Boolean Normal Forms, Shellability, and Reliability Computations.
SIAM J. Discret. Math., 2000

Cyclic scheduling in robotic flowshops.
Ann. Oper. Res., 2000

1997
The polytope of block diagonal matrices and complete bipartite partitionings.
Networks, 1997

Cyclic Scheduling of Identical Parts in a Robotic Cell.
Oper. Res., 1997

Variable and Term Removal From Boolean Formulae.
Discret. Appl. Math., 1997

Hitting or avoiding balls in Euclidean space.
Ann. Oper. Res., 1997

1996
Scheduling jobs of equal length: compleixty, facets and computational results.
Math. Program., 1996

1995
Complexity of Product Positioning and Ball Intersection Problems.
Math. Oper. Res., 1995

Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems.
Ann. Oper. Res., 1995

Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

Local Search in Combinatorial Optimization.
Proceedings of the Artificial Neural Networks: An Introduction to ANN Theory and Practice, 1995

1994
A Complexity Index for Satisfiability Problems.
SIAM J. Comput., 1994

Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs.
Discret. Appl. Math., 1994

1993
Concave extensions for nonlinear 0-1 maximization problems.
Math. Program., 1993

1992
Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization.
SIAM J. Discret. Math., 1992

A decomposition of strongly unimodular matrices into incidence matrices of diagraphs.
Discret. Math., 1992

1991
Detection of spurious states of neural networks.
IEEE Trans. Neural Networks, 1991

1990
Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices.
Math. Oper. Res., 1990

More characterizations of triangulated graphs.
J. Graph Theory, 1990

The basic algorithm for pseudo-Boolean programming revisited.
Discret. Appl. Math., 1990

Polynomial-Time Inference of All Valid Implications for Horn and Related Formulae.
Ann. Math. Artif. Intell., 1990

1989
Recognition problems for special classes of polynomials in 0-1 variables.
Math. Program., 1989

Bimatroidal independence systems.
ZOR Methods Model. Oper. Res., 1989

1987
Dualization of regular Boolean functions.
Discret. Appl. Math., 1987

1986
Strong unimodularity for matrices and hypergraphs.
Discret. Appl. Math., 1986


  Loading...