| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996209548003316 |
|
|
Autore |
Mason Roger |
|
|
Titolo |
Credit Controller's Desktop Guide |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
|
|
|
|
ISBN |
|
1-280-23365-6 |
9786610233656 |
1-4237-2131-4 |
|
|
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (326 p.) : ill |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Sommario/riassunto |
|
What is this book about?Failure to get invoices paid on time always eats into profits, and frequently drives companies into liquidation. The Credit Controller's Desktop Guide is a comprehensive practical guide to collecting debts effectively and covers all aspects of the credit controller's work. Fully up-to-date and written in a clear, practical style, this desktop guide includes case studies, standard letters and forms, and an update on the latest legal developments.ContentsThe cost of creditThe right attitude for credit controlThe right credit policiesOpening a new accountEffective paperworkLettersCollection by telephoneOvercoming excusesSources of informationCredit agenciesFactoringCredit insuranceLess usual chasing methodsWarning signs - danger imminentConditions of saleLegal action - considerations prior to commencementLegal action - obtaining judgmentBad debtsExports.About the authorRoger Mason has considerable practical experience as a company secretary. His early career was with Midland Bank and the Ford Motor Company before becoming finance director of ITC Entertainment Ltd. He was, for 14 years, company secretary and finance director of a leading British greetings card company. He lectures on finance and business matters and has written a number of books.FULLY REVISED AND UPDATED...... to reflect changes caused by The Enterprise Act 2002, it covers |
|
|
|
|
|
|
|
|
|
|
|
|
|
important issues including: bad debtsretention of titleenforcing the judgmentthe increased importance of the final warning letterWHY THIS BOOK WILL BE INVALUABLE TO YOUR BUSINESSThis book will enable you to: quantify the true cost of credit to your organisationdefine the credit control policies that are best suited to youuse a variety of proven collection techniques effectivelyanticipate and overcome excusestake legal action and achieve a satisfactory outcomedetect warning signs of danger early enough |
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910520076503321 |
|
|
Titolo |
Approximation and Online Algorithms : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / / edited by Jochen Koenemann, Britta Peis |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2021.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (286 pages) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 12982 |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Mathematics - Data processing |
Computational Mathematics and Numerical Analysis |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
How to Navigate Through Obstacles -- Approximation Algorithms for Vertex- Connectivity Augmentation on the Cycle -- Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set.-An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity -- Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs -- On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem -- The Traveling k-Median Problem: Approximating Optimal Network Coverage -- EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable |
|
|
|
|
|
|
|
|
|
|
|
Resource -- Several methods of analysis for cardinality constrained bin packing -- Leah Epstein Weighted completion time minimization for capacitated parallel machines -- Server Cloud Scheduling -- FIFO and Randomized Competitive Packet Routing Games -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Analysis of Online Balanced Clustering -- Precedence-Constrained Covering Problems with Multiplicity Constraints -- Contention Resolution, Matrix Scaling and Fair Allocation. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the thoroughly refereed workshop post-proceedings of the 19th International Workshop on Approximation and Online Algorithms, WAOA 2021, held in September 2021. Due to COVID-19 pandemic the conference was held virtually. The 16 revised full papers presented in this book were carefully reviewed and selected from 31 submissions. The papers focus on the design and analysis of algorithms for online and computationally hard problems. |
|
|
|
|
|
|
|
| |