Vol. 9 Issue 1 pp. 000‐000 There is a growing need for integrating environmentally sound choices into supply-chain management research and practice. Perusal of the literature shows that a broad frame of reference for green supply-chain management (GrSCM) is not adequately developed. Regulatory bodies that formulate regulations to meet societal and ecological concerns to facilitate growth of business and economy also suffer from its absence. A succinct classification to help academicians, researchers and practitioners in understanding integrated GrSCM from a wider perspective is needed. Further, sufficient literature is available to warrant such classification. This paper takes an integrated and fresh look into the area of GrSCM. The literature on GrSCM is covered exhaustively from its conceptualization, primarily taking a ‘reverse logistics angle’. Using the rich body of available literature, including earlier reviews that had relatively limited perspectives, the literature on GrSCM is classified on the basis of the problem context in supply chain’s major influential areas. It is also classified on the basis of methodology and approach adopted. Various mathematical tools/techniques used in literature vis-a-vis the contexts of GrSCM are mapped. A timeline indicating relevant papers is also provided as a ready reference. Finally, the findings and interpretations are summarized, and the main research issues and opportunities are highlighted.

Green supply‐chain management: A state‐of‐the‐art literature review

Facility location and supply chain management - A review

Constraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intelligence, computer science, databases, programming languages, and operations research. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics.

The aim of this handbook is to capture the full breadth and depth of the constraint programming field and to be encyclopedic in its scope and coverage. While there are several excellent books on constraint programming, such books necessarily focus on the main notions and techniques and cannot cover also extensions, applications, and languages. The handbook gives a reasonably complete coverage of all these lines of work, based on constraint programming, so that a reader can have a rather precise idea of the whole field and its potential. Of course each line of work is dealt with in a survey-like style, where some details may be neglected in favor of coverage. However, the extensive bibliography of each chapter will help the interested readers to find suitable sources for the missing details. Each chapter of the handbook is intended to be a self-contained survey of a topic, and is written by one or more authors who are leading researchers in the area.

The intended audience of the handbook is researchers, graduate students, higher-year undergraduates and practitioners who wish to learn about the state-of-the-art in constraint programming. No prior knowledge about the field is necessary to be able to read the chapters and gather useful knowledge. Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.

The handbook is organized in two parts. The first part covers the basic foundations of constraint programming, including the history, the notion of constraint propagation, basic search methods, global constraints, tractability and computational complexity, and important issues in modeling a problem as a constraint problem. The second part covers constraint languages and solver, several useful extensions to the basic framework (such as interval constraints, structured domains, and distributed CSPs), and successful application areas for constraint programming.

- Covers the whole field of constraint programming
- Survey-style chapters
- Five chapters on applications

Table of Contents

Foreword (Ugo Montanari) 
Part I : Foundations
Chapter 1. Introduction (Francesca Rossi, Peter van Beek, Toby Walsh) 
Chapter 2. Constraint Satisfaction: An Emerging Paradigm (Eugene C. Freuder, Alan K. Mackworth) 
Chapter 3. Constraint Propagation (Christian Bessiere) 
Chapter 4. Backtracking Search Algorithms (Peter van Beek) 
Chapter 5. Local Search Methods (Holger H. Hoos, Edward Tsang) 
Chapter 6. Global Constraints (Willem-Jan van Hoeve, Irit Katriel)
Chapter 7. Tractable Structures for CSPs (Rina Dechter)
Chapter 8. The Complexity of Constraint Languages
(David Cohen, Peter Jeavons) 
Chapter 9. Soft Constraints (Pedro Meseguer, Francesca Rossi, Thomas Schiex) 
Chapter 10. Symmetry in Constraint Programming
(Ian P. Gent, Karen E. Petrie, Jean-Francois Puget)
Chapter 11. Modelling (Barbara M. Smith) 
Part II : Extensions, Languages, and Applications

Chapter 12. Constraint Logic Programming (Kim Marriott, Peter J. Stuckey, Mark Wallace) 
Chapter 13. Constraints in Procedural and Concurrent Languages (Thom Fruehwirth, Laurent Michel, Christian Schulte)
Chapter 14. Finite Domain Constraint Programming Systems (Christian Schulte, Mats Carlsson) 
Chapter 15. Operations Research Methods in Constraint Programming (John Hooker) 
Chapter 16. Continuous and Interval Constraints(Frederic Benhamou, Laurent Granvilliers) 
Chapter 17. Constraints over Structured Domains
(Carmen Gervet) 
Chapter 18. Randomness and Structure (Carla Gomes, Toby Walsh)
Chapter 19. Temporal CSPs (Manolis Koubarakis)
Chapter 20. Distributed Constraint Programming
(Boi Faltings) 
Chapter 21. Uncertainty and Change (Kenneth N. Brown, Ian Miguel)
Chapter 22. Constraint-Based Scheduling and Planning
(Philippe Baptiste, Philippe Laborie, Claude Le Pape, Wim Nuijten)
Chapter 23. Vehicle Routing (Philip Kilby, Paul Shaw) 
Chapter 24. Configuration (Ulrich Junker)
Chapter 25. Constraint Applications in Networks
(Helmut Simonis)
Chapter 26. Bioinformatics and Constraints (Rolf Backofen, David Gilbert)

/pdf/handbook-of-constraint-programming-53srutguo2.pdf

Handbook of Constraint Programming

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.3.7230&rep=rep1&type=pdf

A simple and effective evolutionary algorithm for the vehicle routing problem

http://web.ist.utl.pt/~ist11038/CD_Casquilho/TSP1992EJOR_Laporte.pdf

The traveling salesman problem: An overview of exact and approximate algorithms

A la suite de la constatation de divergences considerables entre les chiffres obtenus par les differents auteurs pour la valeur du module principal du quartz, nous avons entrepris de nouvelles mesures qui ont montre : 1° Que les divergences entre les chiffres obtenus ne peuvent s'interpreter que par un defaut de controle des lames, macles subsistant en nombre plus ou moins important ou de grosseurs variables; 2° Que la valeur reelle du module piezoelectrique du quartz etait en realite, pour une lame pure, legerement superieure a 7. 10-8 c.g.s.

https://hal.archives-ouvertes.fr/jpa-00233742/document

Sur la valeur absolue du module piézoélectrique principal du quartz

In Bostel et al. (2014), we developed simple and easy-to-use approximation formulae for the length of a Chinese Postman Problem (CPP) optimal tour on directed or undirected strongly connected planar graphs as a function of the number of nodes and the number of arcs of graphs whose nodes are randomly distributed on a square area. These approximations have been obtained from a multi-linear regression analysis, by randomly generating a large number of graphs on a square area of 100 × 100 and determining the optimal tour lengths, and not on a unit square area as indicated erroneously in the article. As a consequence, for the general case of graphs extended over a square region of surface area A, the approximate lengths of optimal tours

/pdf/erratum-to-approximating-the-length-of-chinese-postman-tours-1d21u8hvrc.pdf

Erratum to: Approximating the length of Chinese postman tours

This is a summary of the journal article (Malapert et al. 2012) published by Journal on Computing entitled "An Optimal Constraint Programming Approach to the Open-Shop Problem". The article presents an optimal constraint programming approach for the Open-Shop scheduling problem, which integrates recent constraint propagation and branching techniques with new upper bound heuristics. Randomized restart policies combined with nogood recording allow to search diversification and learning from restarts. This approach is compared with the best-known metaheuristics and exact algorithms, and shows better results on a wide range of benchmark instances.

An optimal constraint programming approach to the Open-Shop Problem

This article addresses the problem of scheduling the replenishment of items to be delivered to multiple buyers from a single provider in order to minimize the total cost including the inventory holding cost, a major ordering cost for each period of replenishment, a minor ordering cost for each item included in a replenishment, and the routing cost. This problem can be modelled as an integer non linear program. The solution methodology is based on Constraint Programming. Experimentation of the proposed model and the solution approach is reported.

Scheduling Multi-Buyer Multi-Item Replenishments: A Constraint Programming Approach

Dans ce travail, nous avons applique les methodes de mesure d'inductance par pont d'impedance, a l'examen des phenomenes qui se produisent lorsqu'on exerce des contraintes de tractions variables sur des pieces d'aciers ordinaires au carbone sans traitement thermique particulier. Nous avons oriente tout particulierement nos observations vers les modifications des proprietes magnetiques constatees lors de l'application de contraintes de valeurs elevees, notamment au voisinage des limites d'elasticite physique, d'ecoulement et de fatigue. Les deux principaux resultats qui semblent ressortir de cette etude preliminaire sont les suivants : 1° Sur un acier soumis a des tractions statiques croissantes, des mesures simultanees, mecaniques et electriques, revelent un domaine intermediaire, caracterise par des allongements permanents de l'ordre de 10^-4 a 10^-6 en valeur relative. Ce domaine est situe entre la limite de reversibilite magnetique qui coinciderait avec la limite d'elasticite physique et la limite d'elasticite apparente ou d'ecoulement du metal. 2° On trace un reseau des courbes permeabilite-effort de traction simp le, repetees entre zero et des amplitudes maxima progressivement croissantes. La pente de la partie ascendante des courbes commence par croitre. La charge maxima qui a precede la courbe a pente maxima semble coincider avec la limite de fatigue de l'acier.

https://hal.archives-ouvertes.fr/jpa-00234407/document

Sur les modifications de la perméabilité magnétique des aciers au carbone, et du fer pur sous l'action des contraintes de traction pure dans un champ alternatif d'amplitude constante

André Langevin

Papers

Sur la valeur absolue du module piézoélectrique principal du quartz

Erratum to: Approximating the length of Chinese postman tours

An optimal constraint programming approach to the Open-Shop Problem

Scheduling Multi-Buyer Multi-Item Replenishments: A Constraint Programming Approach

Sur les modifications de la perméabilité magnétique des aciers au carbone, et du fer pur sous l'action des contraintes de traction pure dans un champ alternatif d'amplitude constante